Downloading: On Matching Girth Domination Number of Graphs
International Journal of Science and Research (IJSR)

International Journal of Science and Research (IJSR)
www.ijsr.net | Open Access | Fully Refereed | Peer Reviewed International Journal

ISSN: 2319-7064


Amazon Sale


To prevent Server Overload, Your Article PDF will be Downloaded in Next Seconds

On Matching Girth Domination Number of Graphs

L. Shyamala, G. Victor Emmanuel, M. Sudalai Kannu, I. Beno

Abstract: A set M of edges of a graph G is a matching if no two edges in M are incident to the same vertex. A set S of vertices in G is a girth dominating set of G if every vertex in V-S is adjacent to atleast one vertex of girth graph is called the girth dominating set. the matching number is the maximum cardinality of a matching of G, while the girth domination number of G is the minimum cardinality taken over all girth domination number and is denoted by _g (G) also the addition of any edge decreases the girth domination number denoted by _mg (G).

Keywords: Matching, Domination Number, Girth Domination, Girth Domination Number, Girth dominating set and Matching Girth domination number


Amazon Sale


Top