On weakly connected domination in graphs
From MaRDI portal
Recommendations
Cites work
- Contributions to the theory of domination, independence and irredundance in graphs
- Dominating sets whose closed stars form spanning trees
- scientific article; zbMATH DE number 3154393 (Why is no real title available?)
- scientific article; zbMATH DE number 3873384 (Why is no real title available?)
- scientific article; zbMATH DE number 3720947 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- On domination and independent domination numbers of a graph
- On Hadwiger's Number and the Stability Number
- Two Bounds for the Domination Number of a Graph
- Using maximality and minimality conditions to construct inequality chains
Cited in
(38)- Connected domination of regular graphs
- Dominating sets whose closed stars form spanning trees
- Spanning star trees in regular graphs
- The minimum weakly connected independent set problem: polyhedral results and branch-and-cut
- On the number of edges in graphs with a given weakly connected domination number
- A note on disconnected weakly k-homogeneous graphs
- Testing equality under the local broadcast model
- Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number
- Weakly connected Roman domination in graphs
- On weakly connected domination in graphs. II.
- On weak domination in graphs
- Weakly connected domination in graphs
- Learning automata-based algorithms for finding minimum weakly connected dominating set in stochastic graphs
- Weakly connected domination stable trees.
- Generalized weakly connected domination in graphs
- Weakly connected domination in graphs resulting from some graph operations
- scientific article; zbMATH DE number 5972296 (Why is no real title available?)
- A note on weakly connected domination number in graphs.
- Upper bounds for domination related parameters in graphs on surfaces
- Connected domination
- scientific article; zbMATH DE number 5717193 (Why is no real title available?)
- scientific article; zbMATH DE number 4104992 (Why is no real title available?)
- Constructing weakly connected dominating set for secure clustering in distributed sensor network
- scientific article; zbMATH DE number 1137956 (Why is no real title available?)
- Similarities and differences between the vertex cover number and the weakly connected domination number of a graph
- scientific article; zbMATH DE number 7034277 (Why is no real title available?)
- scientific article; zbMATH DE number 7602828 (Why is no real title available?)
- On minimum weakly connected independent sets for wireless sensor networks: properties and enumeration algorithm
- scientific article; zbMATH DE number 5879563 (Why is no real title available?)
- MAXIMAL INDEPENDENT SET, WEAKLY-CONNECTED DOMINATING SET, AND INDUCED SPANNERS IN WIRELESS AD HOC NETWORKS
- A ZONAL ALGORITHM FOR CLUSTERING AN HOC NETWORKS
- Restrained weakly connected dominating sets in graphs under some operations
- Domination-related parameters in rooted product graphs
- On a variant of vertex edge domination
- Regular graphs with equal weakly connected domination number and matching number
- On covers and domination in trees
- Bounds relating the weakly connected domination number to the total domination number and the matching number
- A self-stabilizing algorithm for constructing weakly connected minimal dominating sets
This page was built for publication: On weakly connected domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1356466)
