Weakly Connected Domination in Graphs

DOI10.1016/J.ENDM.2009.03.010zbMath1267.05199OpenAlexW1985483238MaRDI QIDQ2839237

No author found.

Publication date: 4 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2009.03.010

zbMATH Keywords

weakly connected domination

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• On weakly connected domination in graphs
• Dominating sets whose closed stars form spanning trees
• On the number of edges in graphs with a given weakly connected domination number
• Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons

Related Items (4)

The signed Roman domination number of two classes graphs ⋮ Weakly connected Roman domination in graphs ⋮ Unnamed Item ⋮ Testing equality under the local broadcast model

This page was built for publication: Weakly Connected Domination in Graphs