Abstract
A \(k\)-connected (resp. \(k\)-edge connected) dominating set \(D\) of a connected graph \(G\) is a subset of \(V(G)\) such that \(G[D]\) is \(k\)-connected (resp. \(k\)-edge connected) and each \(v\in V(G)\backslash D\) has at least one neighbor in \(D\). The \(k\) -connected domination number (resp. \(k\) -edge connected domination number) of a graph \(G\) is the minimum size of a \(k\)-connected (resp. \(k\)-edge connected) dominating set of \(G\), and denoted by \(\gamma _k(G)\) (resp. \(\gamma '_k(G)\)). In this paper, we investigate the relation of independence number and 2-connected (resp. 2-edge-connected) domination number, and prove that for a graph \(G\), if it is \(2\)-edge connected, then \(\gamma '_2(G)\le 4\alpha (G)-1\), and it is \(2\)-connected, then \(\gamma _2(G)\le 6\alpha (G)-3\), where \(\alpha (G)\) is the independent number of \(G\).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Arseneau L, Finbow A, Hartnell B, Maclean D, O’sullivan L (1997) On minimal connected dominating sets. JCMCC 24:185–191
Bo C, Liu B (1996) Some inequalities about the connected domination number. Discret Math 159:241–245
Bondy JA, Murty USR (2008) Graph theory, GTM 244. Springer, Berlin
Caro Y, West D, Yuster R (2000) Connected domination and spanning trees with many leaves. SIAM J Discret Math 13:202–211
Caro Y, Yuster R (2003) 2-Connected graphs with small 2-connected dominating sets. Discret Math 269:265–271
Chellali M, Favaron O, Hansberg A, Volkmann L (2012) \(k\)-Domniantion and \(k\)-independence in graphs: a survey. Graphs Combin 28:1–55
Colbourn CJ, Stewart LK (1990) Permutaion graphs: connected domination and Steiner trees. Discret Math 86:179–189
Du D, Wan P (2013) Connected dominating set: theory and applications. Springer, Berlin
Duchet P, Meyniel H (1982) On Hadwigers number and the stability number. Ann Discret Math 13:71–74
Haynes T, Hedetniemi ST, Slater P (1997) Domination in graphs: the theory. Marcel Dekker, New York
Haynes T, Hedetniemi ST, Slater P (1997) Domination in graphs: selected topics. Marcel Dekker, New York
Li M, Wan P, Yao F (2011) Tighter approximation bounds for minimum CDS in unit disk graphs. Algorithmica 61:1000–1021
Li X, Zhang Z (2010) Two algorithms for minimum 2-connected \(r\)-hop dominating set. Inf Process Lett 110:986–991
Moscarini M (1993) Doubly chordal graphs. Steiner trees, and connected domination, Networks 23:59–69
Pardalos P, Du D, Graham R (2013) Handbook of combinatorial optimization. Springer, Berlin
Sampathkumar E, Walikar H (1979) The connected domination number of a graphs. Math Phys Sci 13:607–613
Wan P, Wang L, Yao F (2008) Two-phased approximation algorithms for minimum CDS in wireless ad hoc networks. In: IEEE ICDCS, pp. 337–344
White K, Farber M, Pulleyblank WR (1985) Steiner trees, connected domination and strongly chordal graphs. Networks 15:109–124
Wu W, Du H, Jia X, Li Y, Huang S (2006) Minimum connected dominating sets and maximal independent sets in unit disk graphs. Theor Comput Sci 352:1–7
Wu W, Gao X, Pardalos PM, Du D (2010) Wireless networking, dominating and packing. Optim Lett 4:347–358
Acknowledgments
This work is supported by NSFC (11161046), Xinjiang Young Talent Project (2013721012), and Research Found of Henan Normal University (qd13042). The authors are grateful to the referees for their careful reading and valuable comments.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Li, H., Yang, Y. & Wu, B. 2-Edge connected dominating sets and 2-Connected dominating sets of a graph. J Comb Optim 31, 713–724 (2016). https://doi.org/10.1007/s10878-014-9783-4
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-014-9783-4