Generalized weakly connected domination in graphs

zbMATH Open1224.05379MaRDI QIDQ3070366FDOQ3070366

Hao Shen, Mao Peng

Publication date: 2 February 2011

Recommendations

• On weakly connected domination in graphs
• Connected domination of regular graphs
• Weakly connected domination subdivision numbers
• On the number of edges in graphs with a given weakly connected domination number
• Weakly connected domination critical graphs

zbMATH Keywords

graph theoryapproximation algorithmconnected dominating setweakly connected dominating setdistance domination

Mathematics Subject Classification ID

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

Cited In (3)

• Weakly convex and convex domination numbers for generalized Petersen and flower snark graphs
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Generalized weakly connected domination in graphs

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