Dominating sets for split and bipartite graphs
Information Processing Letters
Discrete Mathematics - Topics on domination
NP-completeness and degree restricted spanning trees
Discrete Mathematics
Dominating cliques in chordal graphs
Discrete Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Chordal Graphs and Their Clique Graphs
WG '95 Proceedings of the 21st International Workshop on Graph-Theoretic Concepts in Computer Science
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Hereditary Domination in Graphs: Characterization with Forbidden Induced Subgraphs
SIAM Journal on Discrete Mathematics
Constructing Minimum Connected Dominating Sets with Bounded Diameters in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
WASA'10 Proceedings of the 5th international conference on Wireless algorithms, systems, and applications
Note: A note on connected dominating sets of distance-hereditary graphs
Discrete Applied Mathematics
Information Processing Letters
Hi-index | 0.04 |
We study dominating sets whose induced subgraphs have a bounded diameter. Such sets were used in recent papers by Kim et al. and Yu et al. to model virtual backbones in wireless networks where the number of hops required to forward messages within the backbone is minimized. We prove that for any fixed k=1 it is NP-complete to decide whether a given graph admits a dominating set whose induced subgraph has diameter at most k. On the upside, we give a characterization of the chordal graphs that admit such a dominating set. It turns out that in this characterization, the dominating set X can be chosen such that any shortest path between two members of the dominating set is entirely contained in X. Moreover, the characterization yields an O(mn) algorithm to compute, for a given connected chordal graph G on n vertices and m edges, the minimum k for which G has a dominating set whose induced subgraph has diameter at most k. Such a dominating set can be efficiently computed.