Connected domination critical graphs with cut vertices

DOI10.7151/dmgt.2163zbMath1446.05072OpenAlexW2896718858WikidataQ129104678 ScholiaQ129104678MaRDI QIDQ2194530

Pawaton Kaemawichanurat, Nawarat Ananchuen

Publication date: 26 August 2020

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2163

zbMATH Keywords

criticalconnected domination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Related Items (2)

Connected domination critical graphs with a block having maximum number of cut vertices ⋮ Connected Domination

Cites Work

• Total edge critical graphs with leaves
• Connected domination critical graphs.
• On domination critical graphs with cutvertices having connected domination number 3
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Connected domination critical graphs with cut vertices