ON DOUBLY CONNECTED DOMINATION NUMBER OF SOME SPECIAL GRAPHS
Let G be a simple connected graph. Then a connected dominating set is called a doubly connected dominating set of G if the subgraph induced by is connected. The cardinality of the minimum doubly connected dominating set in G is the doubly connected domination number, denoted by
This paper explores the concept of doubly connected domination in graphs. As a result, the value of the parameter (doubly connected domination number) of some special graphs, such as fan, star, wheel, complete multipartite, windmill, friendship, and butterfly graphs has been determined.
connected dominating set, connected domination number, outer-connected dominating set, outer-connected domination number, doubly-connected dominating set, doubly-connected domination number
Received: October 20, 2023; Accepted: December 20, 2023; Published: March 5, 2024
How to cite this article: Sherihatha R. Ahamad, Alkajim A. Aradais and Ladznar S. Laja, On doubly connected domination number of some special graphs, Advances and Applications in Discrete Mathematics 41(3) (2024), 203-211. http://dx.doi.org/10.17654/0974165824014
This Open Access Article is Licensed under Creative Commons Attribution 4.0 International License
References:
[1] A. A. Aradais and F. P. Jamil, Outer-connected semitotal domination in graphs, 2021, Eur. J. Pure Appl. Math.15 (2022), 1265-1279.[2] B. H. Arriola and S. Canoy, Jr., Doubly connected domination in the corona and lexicographic product of graphs, Appl. Math. Sci. 8(31) (2014), 1521-1533.[3] B. H. Arriola and S. Canoy, Jr., Secure doubly connected domination in graphs, Int. Journal of Math. Analysis 8(32) (2014), 1571-1580.[4] C. Berge, The Theory of Graphs and its Applications, Methuen & Co., Ltd., John Wiley & Sons, Inc., London, New York, 1962.[5] J. Cyman, The outer-connected domination number of a graph, Australas J. Combin. 38 (2007), 35-46.[6] J. Cyman, M. LemaĆska and J. Raczek, On the doubly connected domination number of a graph, Central European Journal of Mathematics 4 (2006), 34-45.[7] G. M. Estrada, C. M. Loquias, E. L. Enriquez and C. S. Baraca, Perfect doubly connected domination in the join and corona of graphs, International Journal of Latest Engineering Research and Applications (IJLERA) 4(7) (2019), 17-21.[8] H. Karami, R. Khoeilar and S. M. Sheikholeslami, Doubly connected domination subdivision numbers of graphs, Mat. Vesnik 64 (2012), 232-239.[9] N. N. Kenareh, Domination in Graphs, S. F. University, 2016.[10] Jennifer M. Tarr, Domination in graphs, University of South Florida, 2010.