Show simple item record

dc.contributor.authorThamonwan Saengngammongkholen_US
dc.contributor.authorThanin Sitthiwiratthamen_US
dc.date.accessioned2016-11-28T06:55:12Z
dc.date.available2016-11-28T06:55:12Z
dc.date.issued2014-09
dc.identifier.urihttp://repository.rmutr.ac.th/123456789/334
dc.identifier.urihttp://localhost:8080/xmlui/handle/123456789/334
dc.description.abstractThe Modular Product of graph and graph has vertex set and edge set In this research, we determine generalizations of two edge-graph parameters are matching number and edge covering number on Modular product of simple graph and complete bipartite graph.en_US
dc.description.sponsorshipRajamangala University Of Technology Rattanakosinen_US
dc.language.isoTHen_US
dc.publisherRajamangala University Of Technology Rattanakosinen_US
dc.subjectMatching Numberen_US
dc.subjectEdge Covering Numberen_US
dc.subjectModular Producten_US
dc.titleMatching and Edge Covering Number on Modular Product of Simple Graphen_US
dc.title.alternativeจำนวนจับคู่และจำนวนเส้นปกคลุมบนผลคูณมอดูลาร์ของกราฟอย่างง่ายen_US
dc.typeResearchen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record