On local edge connected domination critical graphs

MaRDI QIDQ3004136zbMATH OpenFDO

Authors N. Ananchuen

Publication date 31 May 2011

zbMATH Keywords

connected dominationcritical graphdiameterdomination

Mathematics Subject Classification ID

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

Recommendations

• Local edge domination critical graphs
• scientific article; zbMATH DE number 2197907
• The diameter of connected domination critical graphs.
• Some structures of \(3-({\gamma}_c, 2)\)-critical graphs which are not \(3-{\gamma}_c\)-critical
• Connected domination critical graphs.

Cited in

(12)

• Local edge domination critical graphs
• A characterization of domination weak bicritical graphs with large diameter
• A characterization of \(3\)-\((\gamma _{c}, 2)\)-critical claw-free graphs which are not \(3\)-\(\gamma _{c }\)-critical
• Critical graphs with respect to total domination and connected domination
• The diameter of connected domination critical graphs.
• Construction of (, k)-critical graphs
• scientific article; zbMATH DE number 5846127 (Why is no real title available?)
• Connected domination
• On connected (,k)-critical graphs
• scientific article; zbMATH DE number 5575545 (Why is no real title available?)
• A note on connected domination critical graphs
• On locally \(k\)-critically \(n\)-connected graphs

This page was built for publication: On local edge connected domination critical graphs

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