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

DOI10.1016/J.AMC.2021.126248MaRDI QIDQ2243262zbMATH OpenOpenAlexFDO

Authors Michael A. Henning, P. Kaemawichanurat

Publication date 11 November 2021

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2021.126248

zbMATH Keywords

connected domination

Mathematics Subject Classification ID

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

Recommendations

• Connected domination critical graphs with cut vertices
• On domination critical graphs with cutvertices having connected domination number 3
• Traceability of connected domination critical graphs
• Connected domination critical graphs.
• On 4-_c-critical graphs with cut-vertices

Cites work

• A note on connected domination critical graphs
• Connected domination critical graphs with cut vertices
• Connected domination critical graphs.
• Factor-bicriticality in connected domination critical graphs
• Hamiltonicity of connected domination critical graphs.
• Hamiltonicity of domination critical claw-free graphs
• scientific article; zbMATH DE number 7034398 (Why is no real title available?)
• scientific article; zbMATH DE number 3702724 (Why is no real title available?)
• Matching properties in connected domination critical graphs
• On 4-_c-critical graphs with cut-vertices
• On domination critical graphs with cutvertices having connected domination number 3
• On the structure of graphs vertex critical with~respect to connected domination
• Traceability of connected domination critical graphs
• Weakly connected domination critical graphs

Cited in

(7)

• Connected domination critical graphs with cut vertices
• Traceability of connected domination critical graphs
• \(k\)-domination and total \(k\)-domination numbers in catacondensed hexagonal systems
• On 4-_c-critical graphs with cut-vertices
• On domination critical graphs with cutvertices having connected domination number 3
• An extension of locating-total domination problem and its complexity
• Connected domination versus dominating sets inducing large components

This page was built for publication: Connected domination critical graphs with a block having maximum number of cut vertices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2243262)