Pages that link to "Item:Q1356427"
From MaRDI portal
The following pages link to Strong weak domination and domination balance in a graph (Q1356427):
Displaying 23 items.
- On the bondage number of middle graphs (Q358187) (← links)
- On the bondage, strong and weak bondage numbers in complementary prism graphs (Q821325) (← links)
- On strong (weak) independent sets and vertex coverings of a graph (Q870977) (← links)
- The influence of special vertices on strong domination (Q1292872) (← links)
- Domination parameters with number 2: interrelations and algorithmic consequences (Q1682877) (← links)
- On vertex types of graphs (Q1756037) (← links)
- RELATIONSHIP BETWEEN BLOCK DOMINATION PARAMETERS OF A GRAPH (Q2864861) (← links)
- Alliances and Related Domination Parameters (Q3384109) (← links)
- Vulnerability Measures of Transformation Graph <i>G</i><sup><i>xy</i>+</sup> (Q3455748) (← links)
- Efficient Self-Stabilizing Algorithm for Independent Strong Dominating Sets in Arbitrary Graphs (Q3455752) (← links)
- Weak edge-degree domination in hypergraphs (Q3599858) (← links)
- Characterizations of trees with equal domination parameters (Q4489489) (← links)
- Independent strong domination in complementary prisms (Q4957962) (← links)
- Bounds on weak and strong total domination in graphs (Q5006580) (← links)
- ON WEAK DOMINATION NUMBER OF SOME GRAPHS (Q5076234) (← links)
- SOME RESULTS ON WEAK DOMINATION IN GRAPHS (Q5076241) (← links)
- Weak and strong domination in thorn graphs (Q5113066) (← links)
- The strong domination problem in block graphs and proper interval graphs (Q5207497) (← links)
- Some Cycle and Star Related Nordhaus-Gaddum Type Relations on Strong Effcient Dominating Sets (Q5215881) (← links)
- Strong vb-dominating and vb-independent sets of a graph (Q5216440) (← links)
- Independent strong weak domination: A mathematical programming approach (Q5858171) (← links)
- Linear programming approach for various domination parameters (Q5859511) (← links)
- (Q5886294) (← links)
