Downloads: 111 | Views: 272
Research Paper | Mathematics | India | Volume 8 Issue 12, December 2019 | Popularity: 6.1 / 10
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
Edition: Volume 8 Issue 12, December 2019
Pages: 1468 - 1474
Make Sure to Disable the Pop-Up Blocker of Web Browser
Similar Articles
Downloads: 2 | Weekly Hits: ⮙1 | Monthly Hits: ⮙1
Research Paper, Mathematics, Spain, Volume 12 Issue 3, March 2023
Pages: 1089 - 1110Hamiltonian Cycles and Travelling Salesfolk
Alberto Gomez Gomez
Downloads: 2 | Weekly Hits: ⮙1 | Monthly Hits: ⮙2
New Innovation and Idea, Mathematics, Zambia, Volume 12 Issue 4, April 2023
Pages: 968 - 979Number Recognition Skills of Non-School going Children: A Pilot Study of Children in Villages Surrounding Tipangeni University, in Zambia
Getrude Chimfwembe-Gondwe
Downloads: 112
Research Paper, Mathematics, India, Volume 6 Issue 9, September 2017
Pages: 1213 - 1217New Implementation of Paired Triple Connected Domination Number of a Graph
A. Rajeswari, G. Mahadevan
Downloads: 130
Research Paper, Mathematics, Korea, North, Volume 7 Issue 11, November 2018
Pages: 822 - 831Hybrid Multiple Attribute Two-Sided Matching Decision Making Based on Grey Relational Fractional Programming Method
Sung-Chol Jang, Gol Kim