[1,2]-Complementary connected domination number of graphs-III

Year 2019, Volume: 68 Issue: 2, 2298 - 2312, 01.08.2019

G. Mahadevan K. Renuka

https://doi.org/10.31801/cfsuasmas.599813

Abstract

A set S⊆V(G) in a graph G is said to be [1,2]-complementary connected dominating set if for every vertex v∈V-S, 1≤|N(v)∩S|≤2 and <V-S> is connected. The minimum cardinality of [1,2]-complementary connected dominating set is called [1,2]-complementary connected domination number and is denoted by γ_{[1,2]cc}(G). In this paper, we investigate 3-regular graphs on twelve vertices for which γ_{[1,2]cc}(G)=χ(G)=3.

Keywords

Complementary connected domination

References

• Chartrand, G.and Lesniak, L., Graphs and Digraphs, Fourth Edition CRC Press, Boca Raton, 2005.
• Haynes, T.W., Hedetniemi, S.T. and Slater, P.J., Fundamentals of Domination in Graphs, Marcel Dekker, Inc., New York, 1998.
• Chellali, Mustapha, Haynes, Teresa W., Hedetniemi, Stephen T. and McRae, Alice, [1,2]-Sets in graphs, Discrete Applied Mathematics, 161, (2013), 2885-2893.
• Mahadevan, G., Renuka, K. and Sivagnanam, C., [1,2]-Complementary connected domination number of graphs, International Journal of Computational and Applied Mathematics, 12(1), (2017), 281-288.
• Mahadevan, G., Renuka, K. and Sivagnanam, C., [1,2]-Complementary connected domination number of graphs-II, International Journal of Pure and Applied Mathematics, 117(11), (2017), 165-175.
• Kulli, V.R. and Janakiraman, B., The nonsplit domination number of a graph, Indian Journal of Pure and Applied Math, Vol. 31, No. 5, (2000), 545-550.
• Yang, Xiaojing and Wu, Baoyindureng, [1,2]-domination in graphs, Discrete Applied Mathematics, 175, (2014), 79-86.