Connected domination critical graphs.

DOI10.1016/S0893-9659(04)90118-8MaRDI QIDQ1764547zbMATH OpenOpenAlexFDO

Authors Liang Sun, De-Xiang Ma, Xuegang Chen

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

zbMATH Keywords

connected domination numbercritical graphs

Mathematics Subject Classification ID

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

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

Cites work

• Critical concepts in domination
• Domination critical graphs
• Hamiltonian properties of domination-critical graphs
• scientific article; zbMATH DE number 1248191 (Why is no real title available?)
• scientific article; zbMATH DE number 1472188 (Why is no real title available?)

Cited in

(28)

• 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
• Connected domination critical graphs with cut vertices
• Connected domination critical graphs with a block having maximum number of cut vertices
• Matching properties in connected domination critical graphs
• Traceability of connected domination critical graphs
• (-1)-critical graphs.
• Critical graphs with respect to total domination and connected domination
• The spectrum of dihedral quadruoke systems
• Connected domination stable graphs upon edge addition
• On the structure of graphs vertex critical with~respect to connected domination
• On local edge connected domination critical graphs
• On 4-_c-critical graphs with cut-vertices
• Weakly connected domination stable trees.
• Connected domination
• On connected (,k)-critical graphs
• Connected domination critical graphs with respect to relative complements
• Weakly connected domination critical graphs
• scientific article; zbMATH DE number 1145918 (Why is no real title available?)
• The connectivity of domination dot-critical graphs with no critical vertices
• Connected domination value in graphs
• scientific article; zbMATH DE number 6464011 (Why is no real title available?)
• A note on connected domination critical graphs
• On domination critical graphs with cutvertices having connected domination number 3
• Connected certified domination edge critical and stable graphs
• Independence number and connectivity of maximal connected domination vertex critical graphs
• Changing of the number of minimum dominating sets after edge addition: non critical edges
• Domination criticality in product graphs

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)