On the diameter of a domination dot-critical graph
From MaRDI portal
Publication:1028143
DOI10.1016/J.DAM.2008.10.015zbMATH Open1182.05066OpenAlexW2034571779MaRDI QIDQ1028143
Publication date: 30 June 2009
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2008.10.015
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
Related Items (11)
Edge-removal and edge-addition in \(\alpha \)-domination ⋮ Total domination dot-critical graphs ⋮ Title not available (Why is that?) ⋮ Upper bound on the diameter of a domination dot-critical graph ⋮ Upper bounds on the diameter of domination dot-critical graphs with given connectivity ⋮ The connectivity of domination dot-critical graphs with no critical vertices ⋮ A note on the domination dot-critical graphs ⋮ Total domination dot-stable graphs ⋮ Title not available (Why is that?) ⋮ The diameter of paired-domination vertex critical graphs ⋮ Upper bound on the diameter of a total domination vertex critical graph.
This page was built for publication: On the diameter of a domination dot-critical graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1028143)