Dominating cliques in graphs
A set of vertices in a graph is called a dominating set if every vertex not in the set of adjacent to at least one vertex in the set. A dominating clique is a dominating set that induces a complete subgraph. The authors discuss various conditions that suffice to guarantee the existence of a dominating clique. Furthermore, a polynomial algorithm is presented that finds a dominating clique in finite connected graphs with no induced \(P_ 5\) or \(C_ 5\). Finally, a forbidden subgraph characterization is given for a class of graphs that have a connected dominating set of size three.
- `` Strong NP-Completeness Results
- A linear algorithm for the domination number of a tree
- A Note on "The Comparability Graph of a Tree"
- Dominating sets for split and bipartite graphs
- Dominating Sets in Chordal Graphs
- Dominating sets in social network graphs
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3873384 (Why is no real title available?)
- scientific article; zbMATH DE number 3910441 (Why is no real title available?)
- scientific article; zbMATH DE number 4055676 (Why is no real title available?)
- scientific article; zbMATH DE number 3632548 (Why is no real title available?)
- Optimum domination in weighted trees
- Parallel concepts in graph theory
- Sufficient Conditions for Graphs to Have Threshold Number 2
- The Complexity of the Partial Order Dimension Problem
- Total domination in graphs
- Towards a theory of domination in graphs
- Minimum partition of an independence system into independent sets
- Complete description of forbidden subgraphs in the structural domination problem
- Clustering and domination in perfect graphs
- Dominating cliques in \(P_ 5\)-free graphs
- Dominating cliques in chordal graphs
- Dominating subgraphs in graphs with some forbidden structures
- A note on \(r\)-dominating cliques
- \(H\)-domination in graphs
- Algorithmic aspects of semitotal domination in graphs
- On identifying dominant cliques.
- The complexity of connected dominating sets and total dominating sets with specified induced subgraphs
- New results on connected dominating structures in graphs
- Uniform clutters and dominating sets of graphs
- The parametric complexity of graph diameter augmentation
- On-line graph coloring of \({\mathbb{P}_5}\)-free graphs
- Clique independence, domination and irredundance in graphs
- A detailed study of the dominating cliques phase transition in random graphs
- scientific article; zbMATH DE number 4204394 (Why is no real title available?)
- On the problem of domino recognition
- scientific article; zbMATH DE number 1185594 (Why is no real title available?)
- Dominating sets with small clique covering number
- Dominating cliques in graphs
- On the existence of total dominating subgraphs with a prescribed additive hereditary property
- Domination properties and induced subgraphs
- Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs
- Bibliography on domination in graphs and some basic definitions of domination parameters
- Characterization of graphs dominated by induced paths
- Hereditarily dominated graphs
- Characterization of \(P_{6}\)-free graphs
- Infinite versus finite graph domination
- A new characterization of \(P_{6}\)-free graphs
This page was built for publication: Dominating cliques in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5896554)
