On the vertices belonging to all, some, none minimum dominating set

DOI10.1016/j.dam.2020.08.020zbMath1451.05167arXiv1909.02843OpenAlexW3081021201MaRDI QIDQ2208334

François Delbot, Valentin Bouquet, Christophe Picouleau

Publication date: 2 November 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1909.02843

zbMATH Keywords

claw-free graphchordal graphminimum dominating setco-graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

Polynomial time recognition of vertices contained in all (or no) maximum dissociation sets of a tree

Cites Work

• Unnamed Item
• Unnamed Item
• Domination alteration sets in graphs
• On domination and independent domination numbers of a graph
• A linear algorithm for the domination number of a tree
• On the number of vertices belonging to all maximum stable sets of a graph
• Changing and unchanging of the domination number of a graph
• Dominating Sets in Chordal Graphs