Double domination stable graphs upon edge removal

zbMATH Open1218.05111MaRDI QIDQ5393545FDOQ5393545

Authors: Mustapha Chellali, Teresa W. Haynes 

Publication date: 18 April 2011

Recommendations

• Double domination critical and stable graphs upon vertex removal
• Double domination edge removal critical graphs
• Double bondage in graphs
• Vertices belonging to all or to no minimum double dominating sets in trees
• scientific article; zbMATH DE number 1843906

zbMATH Keywords

edge removaldouble domination numberdouble dominating set

Mathematics Subject Classification ID

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

Cited In (7)

• An extremal problem for total domination stable graphs upon edge removal
• \(k\)-domination and \(k\)-independence in graphs: A survey
• Double domination critical and stable graphs upon vertex removal
• Double domination and super domination in trees
• Hamiltonicities of double domination critical and stable claw-free graphs
• Double domination edge removal critical graphs
• Double bondage in graphs

This page was built for publication: Double domination stable graphs upon edge removal

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