Excellent graphs with respect to domination: subgraphs induced by minimum dominating sets

DOI10.47443/dml.2020.0052zbMath1499.05497arXiv2010.03219OpenAlexW3092419683MaRDI QIDQ5862679

No author found.

Publication date: 9 March 2022

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

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

zbMATH Keywords

domination numbergraph productexcellent graph

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Uses Software

• GENREG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(\gamma\)-excellent, critically dominated, end-dominated, and dot-critical trees are equivalent
• Well-covered graphs and extendability
• Minimal dominating sets of cardinality two in a graph
• A characterization of \(i\)-excellent trees
• Total domination excellent trees
• Very excellent graphs and rigid very excellent graphs
• Domination in graphs of minimum degree five
• DOMINATION IN GRAPHS OF MINIMUM DEGREE FOUR
• Vertex domination-critical graphs
• Fast generation of regular graphs and construction of cages
• Roman domination excellent graphs: trees
• Paths, Stars and the Number Three
• Some covering concepts in graphs
• Domination critical graphs