Critical concepts in domination

DOI10.1016/0012-365X(90)90347-KzbMATH Open0725.05049MaRDI QIDQ2277481FDOQ2277481

David P. Sumner

Publication date: 1990

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

Recommendations

• Topics on domination
• A new domination conception
• Some remarks on domination
• Towards a new framework for domination
• Bicritical domination
• The diversity of domination
• A paradoxical argument about domination
• Pervasive domination
• On dominance
• Total domination and transformation

zbMATH Keywords

domination numberdegree sequencesdomination perfect graphsdomination k-critical graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cites Work

• Title not available (Why is that?)
• Domination alteration sets in graphs
• Domination critical graphs
• Domination critical graphs
• On domination and independent domination numbers of a graph
• Relations between packing and covering numbers of a tree
• Tough graphs and Hamiltonian circuits.
• Two Bounds for the Domination Number of a Graph
• 1-Factors and Antifactor Sets
• Title not available (Why is that?)
• On the existence of 1-factors in partial squares of graphs

Cited In (41)

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

This page was built for publication: Critical concepts in domination

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2277481)