Connected domination critical graphs.

DOI10.1016/S0893-9659(04)90118-8zbMATH Open1055.05110OpenAlexW2044380523MaRDI QIDQ1764547FDOQ1764547

Authors: Xuegang Chen, Liang Sun, De-Xiang Ma 

Publication date: 25 February 2005

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0893-9659(04)90118-8

Recommendations

• On domination critical graphs with cutvertices having connected domination number 3
• scientific article; zbMATH DE number 6464011
• Some structures of \(3-({\gamma}_c, 2)\)-critical graphs which are not \(3-{\gamma}_c\)-critical
• Matching properties in connected domination critical graphs
• Connected domination critical graphs with respect to relative complements

zbMATH Keywords

critical graphsconnected domination number

Mathematics Subject Classification ID

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

Cites Work

• Critical concepts in domination
• Domination critical graphs
• Title not available (Why is that?)
• Hamiltonian properties of domination-critical graphs
• Title not available (Why is that?)

Cited In (27)

• Connected domination critical graphs with cut vertices
• Connected domination value in graphs
• Critical graphs with respect to total domination and connected domination
• Weakly connected domination critical graphs
• Some results on the independence number of connected domination critical graphs
• Connected domination critical graphs with respect to relative complements
• On local edge connected domination critical graphs
• Connected domination critical graphs with a block having maximum number of cut vertices
• Connected certified domination edge critical and stable graphs
• On 4-\(\gamma_c\)-critical graphs with cut-vertices
• The spectrum of dihedral quadruoke systems
• On domination critical graphs with cutvertices having connected domination number 3
• Independence number and connectivity of maximal connected domination vertex critical graphs
• Traceability of connected domination critical graphs
• On connected \((\gamma,k)\)-critical graphs
• Matching properties in connected domination critical graphs
• Title not available (Why is that?)
• \((-1)\)-critical graphs.
• The connectivity of domination dot-critical graphs with no critical vertices
• Domination criticality in product graphs
• Connected domination stable graphs upon edge addition
• Changing of the number of minimum dominating sets after edge addition: non critical edges
• Weakly connected domination stable trees.
• On the structure of graphs vertex critical with~respect to connected domination
• A note on connected domination critical graphs
• A characterization of \(3\)-\((\gamma _{c}, 2)\)-critical claw-free graphs which are not \(3\)-\(\gamma _{c }\)-critical
• Connected domination

This page was built for publication: Connected domination critical graphs.

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