Title of article
Domination parameters of the splitting graph of a graph
Author/Authors
Deepalakshmi ، J. Department of Mathematics - Madurai Kamaraj University , Marimuthu ، G. Department of Mathematics - Madura College , Somasundaram ، Arumugam Department of Mathematics - Birla Institute of Technology Science, Pilani, Dubai Campus - Dubai International Academic City , Arumugam ، Subramanian National Centre for Advanced Research in Discrete Mathematics - Kalasalingam Academy of Research and Education
From page
631
To page
637
Abstract
Let G = (V, E) be a graph of order n and size m. The graph Sp(G) obtained from G by adding a new vertex v´ for every vertex v ∈ V and joining v´ to all neighbors of v in G is called the splitting graph of G. In this paper, we determine the domination number, the total domination number, connected domination number, paired domination number and independent domination number for the splitting graph Sp(G).
Keywords
splitting graph , domination , total domination , connected domination , paired domination , independent domination
Journal title
Communications in Combinatorics and Optimization
Journal title
Communications in Combinatorics and Optimization
Record number
2741118
Link To Document