On domination critical graphs with cutvertices having connected domination number 3

DOI10.12988/imf.2007.07277zbMath1145.05038OpenAlexW2516349952MaRDI QIDQ5453823

Nawarat Ananchuen

Publication date: 3 April 2008

Published in: International Mathematical Forum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.12988/imf.2007.07277

zbMATH Keywords

extremal graphconnected dominating setconnected domination numbercutvertex

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (8)

Traceability of connected domination critical graphs ⋮ Connected domination critical graphs with cut vertices ⋮ Some results on the independence number of connected domination critical graphs ⋮ A characterization of \(3\)-\((\gamma _{c}, 2)\)-critical claw-free graphs which are not \(3\)-\(\gamma _{c }\)-critical ⋮ Unnamed Item ⋮ Matching properties in connected domination critical graphs ⋮ Connected domination critical graphs with a block having maximum number of cut vertices ⋮ Connected Domination

This page was built for publication: On domination critical graphs with cutvertices having connected domination number 3