On Paired Double Domination for Degree Splitting Graphs of Some Graphs
Main Article Content
Abstract
In this paper, we introduced the new concept Paired double domination number for degree splitting graph of standard graphs. A paired – double dominating set of a graph G with no isolated vertex is a double dominating sets of vertices whose induced subgraph has a perfect matching. A Paired double domination number is the minimum cardinality of a paired double dominating set of G. Let be a graph with where is the set having at least two vertices of same degree and The degree splitting graph is obtained from G by adding vertices and joining to each vertex of for . We establish Paired double domination number of graphs path, cycle, star, bistar, complete bipartite and complete graph.
Article Details
References
T.W. Haynes, S.T. Hedetniemi P.J. Slater, Fundamentals of Domination in Graphs, Marcel Dekker in NewYork,1998.
Munjula. C .Gudgeri, Varsha, Double Domination Number of Some Families of Graphs, International Journal of Recent Technology and Engineering (IJRTE) ISSN:2277-3878, Volume-9 Issue-2, July 2020.
Teresa W. Haynes, Mustapha Chellali, Mostafa Blidia, Characterization of trees with equal paired and double domination numbers.
T.W. Haynes, P.J. Slater, Paired-domination in graphs, Networks32(1998),199-206.
F. Harary, T.W. Haynes, Double domination in graphs, Arscombin55(2000),201-213.
John AdrianBondy, Murty U.S. R, Graph theory springer,2008.
S. Somasundaram R. Ponraj. On the degree splitting graph of a graph. National
Academy Science Letters, 27(7-8), 2004.
M. N. Sree Valli and V. Anusuya, On paired-double domination number of graphs, Advances in Mathematics: Scientific Journal 9(2020), no 6, 4193-4201.
M. N. Sree Valli and V. Anusuya, On paired-double domination number of grids graphs, Mathematical Statistician and Engineering Application(2022), Vol.71,no. 2, 693-701.
M. N. Sree Valli and V. Anusuya, On paired-double domination number of special graphs,(2021)Journal of xidian University, vol 15,no.8, 449-456.