Matching and Edge Covering Number on Modular Product of  Simple Graph

Thamonwan   Saengngammongkhol; Thanin   Sitthiwirattham

View/Open

Fulltext (1.196Mb)

Date

2014-09

Author

Thamonwan Saengngammongkhol

Thanin Sitthiwirattham

Metadata

Show full item record

Abstract

The 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.

URI

http://repository.rmutr.ac.th/123456789/334
http://localhost:8080/xmlui/handle/123456789/334

Collections

งานวิจัย (Research)