Critical concepts in domination

DOI10.1016/0012-365X(90)90347-KzbMath0725.05049MaRDI QIDQ2277481

David P. Sumner

Publication date: 1990

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

zbMATH Keywords

domination numberdegree sequencesdomination perfect graphsdomination k-critical graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (37)

Domination stability in graphs ⋮ The diameter of total domination vertex critical graphs ⋮ Bicritical domination and double coalescence of graphs ⋮ Irredundance perfect graphs ⋮ Local edge domination critical graphs ⋮ Note: The diameter of edge domination critical graphs ⋮ Paired domination stability in graphs ⋮ RESTRAINED CRITICAL AND ABUNDANT SIGNED GRAPHS ⋮ Constructing connected bicritical graphs with edge-connectivity 2 ⋮ Total domination stability in graphs ⋮ Common domination perfect graphs ⋮ Hamilton-connectivity of 3-domination-critical graphs with \(\alpha \leqslant\delta\) ⋮ Construction of trees and graphs with equal domination parameters ⋮ Changing and unchanging domination: A classification ⋮ The maximum diameter of total domination edge-critical graphs ⋮ Split Domination Vertex Critical and Edge Critical Graphs ⋮ EveryK_1,7andK_1,3-free, 3-vertex critical graph of even order has a perfect matching ⋮ Domatically perfect graphs ⋮ Hamilton-connectivity of 3-domination critical graphs with \(\alpha =\delta +1\geqslant 5\) ⋮ Vertex criticality for upper domination and irredundance ⋮ A note on an induced subgraph characterization of domination perfect graphs ⋮ Properties of total domination edge-critical graphs ⋮ Connected domination critical graphs. ⋮ Some notes on domination edge critical graphs ⋮ Codiameters of 3-connected 3-domination critical graphs ⋮ On an open problem concerning total domination critical graphs ⋮ Changing and unchanging of the domination number of a graph ⋮ The diameter of paired-domination vertex critical graphs ⋮ Varieties of Roman Domination ⋮ Multiple Domination ⋮ Distance Domination in Graphs ⋮ Hamiltonicity in 3-domination-critical graphs with \(\alpha= \delta+2\) ⋮ Some properties of 3-domination-critical graphs ⋮ Bicritical domination ⋮ On the total domination critical graphs ⋮ Closure systems and their structure ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters

Cites Work

• Unnamed Item
• Unnamed Item
• Domination alteration sets in graphs
• On domination and independent domination numbers of a graph
• Relations between packing and covering numbers of a tree
• Tough graphs and Hamiltonian circuits.
• 1-Factors and Antifactor Sets
• On the existence of 1-factors in partial squares of graphs
• Two Bounds for the Domination Number of a Graph
• Domination critical graphs
• Domination critical graphs

This page was built for publication: Critical concepts in domination