Critical concepts in domination
[For the entire collection see Zbl 0716.00005.] The paper studies domination critical and domination perfect graphs. A graph is domination critical, if its domination number is k and decreases after adding any new edge. A graph is domination perfect, if the domination number of any of its subgraphs is equal to its independent domination number, i.e. the minimum number of vertices of a set which is simultaneously independent and dominating in G. Various properties of 3- critical graphs are described; degree sequences and diameters of such graphs are investigated. At the end some theorems on domination perfect graphs are proved, among them a theorem characterizing planar domination perfect graphs by means of forbidden induced subgraphs.
- 1-Factors and Antifactor Sets
- Domination alteration sets in graphs
- Domination critical graphs
- Domination critical graphs
- scientific article; zbMATH DE number 3596896 (Why is no real title available?)
- scientific article; zbMATH DE number 3221976 (Why is no real title available?)
- On domination and independent domination numbers of a graph
- On the existence of 1-factors in partial squares of graphs
- Relations between packing and covering numbers of a tree
- Tough graphs and Hamiltonian circuits.
- Two Bounds for the Domination Number of a Graph
- Topics on domination
- Hamiltonicity in 3-domination-critical graphs with = +2
- Some properties of 3-domination-critical graphs
- The diversity of domination
- Local edge domination critical graphs
- Hamilton-connectivity of 3-domination-critical graphs with \(\alpha \leqslant\delta\)
- Changing and unchanging domination: A classification
- Closure systems and their structure
- Total domination stability in graphs
- Connected domination critical graphs.
- The diameter of total domination vertex critical graphs
- Irredundance perfect graphs
- Construction of trees and graphs with equal domination parameters
- Hamilton-connectivity of 3-domination critical graphs with \(\alpha =\delta +1\geqslant 5\)
- Changing and unchanging of the domination number of a graph
- Bicritical domination
- Vertex criticality for upper domination and irredundance
- Codiameters of 3-connected 3-domination critical graphs
- Domination stability in graphs
- Every \(K_{1,7}\) and \(K_{1,3}\)-free, 3-vertex critical graph of even order has a perfect matching
- Bicritical domination and double coalescence of graphs
- Varieties of Roman Domination
- Multiple domination
- Distance domination in graphs
- On the total domination critical graphs
- The diameter of paired-domination vertex critical graphs
- Constructing connected bicritical graphs with edge-connectivity 2
- Note: The diameter of edge domination critical graphs
- scientific article; zbMATH DE number 1124609 (Why is no real title available?)
- scientific article; zbMATH DE number 1934392 (Why is no real title available?)
- Paired domination stability in graphs
- Split domination vertex critical and edge critical graphs
- Domatically perfect graphs
- A note on an induced subgraph characterization of domination perfect graphs
- Domination critical graphs upon edge subdivision
- Some notes on domination edge critical graphs
- RESTRAINED CRITICAL AND ABUNDANT SIGNED GRAPHS
- Common domination perfect graphs
- The maximum diameter of total domination edge-critical graphs
- 4-total domination game critical graphs
- Optimizing message dissemination in social networks through fuzzy regular equitable fair domination
- Certified domination critical graphs upon vertex removal
- Domination in graphs and the removal of a matching
- Notes on double Roman domination edge critical graphs
- On Camby-Plein's characterization of domination perfect graphs
- Bibliography on domination in graphs and some basic definitions of domination parameters
- Properties of total domination edge-critical graphs
- On an open problem concerning total domination 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)
