2-edge connected dominating sets and 2-connected dominating sets of a graph
From MaRDI portal
Publication:5963646
DOI10.1007/s10878-014-9783-4zbMath1342.90166MaRDI QIDQ5963646
Yuxing Yang, Baoyindureng Wu, Hengzhe Li
Publication date: 23 February 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-014-9783-4
Related Items
Nordhaus-Gaddum-type results on the connected edge domination number, On the double Roman domination of graphs, \(p\)-edge/vertex-connected vertex cover: parameterized and approximation algorithms, 2-(edge-)connected edge domination number and matching number, Connected Domination
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Connected dominating set. Theory and applications
- Tighter approximation bounds for minimum CDS in unit disk graphs
- \(k\)-domination and \(k\)-independence in graphs: A survey
- Minimum connected dominating sets and maximal independent sets in unit disk graphs
- Some inequalities about connected domination number
- Permutation graphs: Connected domination and Steiner trees
- 2-connected graphs with small 2-connected dominating sets.
- Two algorithms for minimum 2-connected \(r\)-hop dominating set
- Wireless networking, dominating and packing
- On Hadwiger's Number and the Stability Number
- Steiner trees, connected domination and strongly chordal graphs
- Connected Domination and Spanning Trees with Many Leaves
- Handbook of Combinatorial Optimization
- Doubly chordal graphs, steiner trees, and connected domination