Domination critical graphs
From MaRDI portal
Publication:5917319
DOI10.1016/0095-8956(83)90007-2zbMath0512.05055OpenAlexW2063706155MaRDI QIDQ5917319
David P. Sumner, Pattie Blitch
Publication date: 1983
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(83)90007-2
Related Items (69)
Domination stability in graphs ⋮ A note on domination 3-edge-critical planar graphs ⋮ The diameter of total domination vertex critical graphs ⋮ An extremal problem for edge domination insensitive graphs ⋮ Local edge domination critical graphs ⋮ The bondage and reinforcement numbers of \(\gamma_ f\) for some graphs ⋮ Traceability of connected domination critical graphs ⋮ Hamiltonian properties of domination-critical graphs ⋮ Paired domination stability in graphs ⋮ Construction for trees without domination critical vertices ⋮ Hamiltonicities of double domination critical and stable claw-free graphs ⋮ Some toughness results in independent domination critical graphs ⋮ Critical concepts of restrained domination in signed graphs ⋮ Domination criticality in product graphs ⋮ Matching of \(5-\gamma \)-critical leafless graph with a cut edge ⋮ Constructing connected bicritical graphs with edge-connectivity 2 ⋮ Total domination stability in graphs ⋮ Hamilton-connectivity of 3-domination-critical graphs with \(\alpha \leqslant\delta\) ⋮ Perfect matchings in paired domination vertex critical graphs ⋮ Some results related to the toughness of 3-domination critical graphs ⋮ Changing and unchanging domination: A classification ⋮ New results on 3-domination critical graphs ⋮ A characterization of \(3\)-\((\gamma _{c}, 2)\)-critical claw-free graphs which are not \(3\)-\(\gamma _{c }\)-critical ⋮ Matching properties in domination critical graphs. ⋮ Reducing the domination number of graphs via edge contractions and vertex deletions ⋮ Maximum number of edges in connected graphs with a given domination number ⋮ The maximum diameter of total domination edge-critical graphs ⋮ A characterization of \(3\)-\(\gamma\)-critical graphs which are not bicritical ⋮ Perfect matchings in total domination critical graphs ⋮ Split Domination Vertex Critical and Edge Critical Graphs ⋮ An optimal algorithm to find minimum k-hop dominating set of interval graphs ⋮ Minimum 2-tuple dominating set of an interval graph ⋮ 3-factor-criticality in domination critical graphs ⋮ Domatically perfect graphs ⋮ On domination and reinforcement numbers in trees ⋮ Matching properties in connected domination critical graphs ⋮ Hamilton-connectivity of 3-domination critical graphs with \(\alpha =\delta +1\geqslant 5\) ⋮ Extremal graphs domination insensitive to the removal of \(k\) edges ⋮ Graphs whose vertex independence number is unaffected by single edge addition or deletion ⋮ On the spectral radius of graphs with a given domination number ⋮ Distance domination-critical graphs ⋮ Properties of total domination edge-critical graphs ⋮ Connected domination critical graphs. ⋮ Some notes on domination edge critical graphs ⋮ The structure of \(4-\gamma \)-critical graphs with a cut vertex ⋮ Codiameters of 3-connected 3-domination critical graphs ⋮ Critical concepts in domination ⋮ Minimum 2-tuple dominating set of permutation graphs ⋮ A survey of selected recent results on total domination in graphs ⋮ Weakly connected domination stable trees ⋮ Total Roman domination edge-critical graphs ⋮ Changing and unchanging of the domination number of a graph ⋮ The diameter of paired-domination vertex critical graphs ⋮ Changing and unchanging of the radius of a graph ⋮ Codiameters of 3-domination critical graphs with toughness more than one ⋮ Paired domination vertex critical graphs ⋮ A new proof of Wojcicka's conjecture ⋮ An optimal algorithm to find minimum k-hop connected dominating set of permutation graphs ⋮ Hamiltonicity in 3-domination-critical graphs with \(\alpha= \delta+2\) ⋮ A characterization of 3-i-critical graphs of connectivity two ⋮ All My Favorite Conjectures Are Critical ⋮ Some properties of 3-domination-critical graphs ⋮ Upper bounds on the bondage number of a graph ⋮ On the \((Q\)-)index of 2-domination critical graphs ⋮ Bicritical domination ⋮ Excellent graphs with respect to domination: subgraphs induced by minimum dominating sets ⋮ Hamilton-connectivity of 3-domination critical graphs with \(\alpha = \delta + 2\) ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters ⋮ Domination dot-critical graphs
Cites Work
This page was built for publication: Domination critical graphs
