Pages that link to "Item:Q1356466"
From MaRDI portal
The following pages link to On weakly connected domination in graphs (Q1356466):
Displaying 31 items.
- Upper bounds for domination related parameters in graphs on surfaces (Q334124) (← links)
- Constructing weakly connected dominating set for secure clustering in distributed sensor network (Q421263) (← links)
- Bounds relating the weakly connected domination number to the total domination number and the matching number (Q967362) (← links)
- A self-stabilizing algorithm for constructing weakly connected minimal dominating sets (Q989481) (← links)
- Connected domination of regular graphs (Q1025488) (← links)
- Dominating sets whose closed stars form spanning trees (Q1357724) (← links)
- Spanning star trees in regular graphs (Q1376073) (← links)
- The minimum weakly connected independent set problem: polyhedral results and branch-and-cut (Q1751176) (← links)
- On the number of edges in graphs with a given weakly connected domination number (Q1849997) (← links)
- A note on disconnected weakly \(k\)-homogeneous graphs (Q1865625) (← links)
- Testing equality under the local broadcast model (Q2117734) (← links)
- Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number (Q2231756) (← links)
- Weakly connected Roman domination in graphs (Q2322879) (← links)
- On weakly connected domination in graphs. II. (Q2581406) (← links)
- On weak domination in graphs (Q2713615) (← links)
- Weakly connected domination in graphs (Q2839237) (← links)
- LEARNING AUTOMATA-BASED ALGORITHMS FOR FINDING MINIMUM WEAKLY CONNECTED DOMINATING SET IN STOCHASTIC GRAPHS (Q3070074) (← links)
- Weakly connected domination stable trees (Q3070109) (← links)
- (Q3097112) (← links)
- Connected Domination (Q3384607) (← links)
- (Q3565865) (← links)
- (Q4383370) (← links)
- Similarities and Differences Between the Vertex Cover Number and the Weakly Connected Domination Number of a Graph (Q4595596) (← links)
- (Q4627713) (← links)
- (Q5040837) (← links)
- On minimum weakly connected independent sets for wireless sensor networks: properties and enumeration algorithm (Q5247696) (← links)
- (Q5393557) (← links)
- MAXIMAL INDEPENDENT SET, WEAKLY-CONNECTED DOMINATING SET, AND INDUCED SPANNERS IN WIRELESS AD HOC NETWORKS (Q5696910) (← links)
- A ZONAL ALGORITHM FOR CLUSTERING AN HOC NETWORKS (Q5696911) (← links)
- Domination-related parameters in rooted product graphs (Q5964910) (← links)
- (Q6145871) (← links)
