Dominating cliques in graphs
From MaRDI portal
Publication:5925264
DOI10.1016/0012-365X(90)90353-JzbMath0722.05040MaRDI QIDQ5925264
Margaret B. Cozzens, Laura L. Kelleher
Publication date: 1990
Published in: Discrete Mathematics (Search for Journal in Brave)
05C35: Extremal problems in graph theory
05C85: Graph algorithms (graph-theoretic aspects)
05C99: Graph theory
Related Items
Weighted connected \(k\)-domination and weighted \(k\)-dominating clique in distance-hereditary graphs, Dominating sets in social network graphs, An exact algorithm for the minimum dominating clique problem
Cites Work
- Dominating sets for split and bipartite graphs
- Dominating sets in social network graphs
- A linear algorithm for the domination number of a tree
- Optimum domination in weighted trees
- The Complexity of the Partial Order Dimension Problem
- Total domination in graphs
- Sufficient Conditions for Graphs to Have Threshold Number 2
- Dominating Sets in Chordal Graphs
- Towards a theory of domination in graphs
- A Note on "The Comparability Graph of a Tree"
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item