The following pages link to (Q4820525):
Displayed 17 items.
- An upper bound for the total restrained domination number of graphs (Q367057) (← links)
- 2-distance paired-dominating number of graphs (Q489733) (← links)
- On the distance paired domination of generalized Petersen graphs \(P(n,1)\) and \(P(n,2)\) (Q491215) (← links)
- Dominating direct products of graphs (Q879339) (← links)
- Total outer-connected domination numbers of trees (Q967375) (← links)
- Vertices contained in all or in no minimum paired-dominating set of a tree (Q995930) (← links)
- Paired bondage in trees (Q998438) (← links)
- A polynomial-time algorithm for the paired-domination problem on permutation graphs (Q1003667) (← links)
- On bondage numbers of graphs: a survey with some comments (Q1953664) (← links)
- Paired domination versus domination and packing number in graphs (Q2165257) (← links)
- Critical paired dominating sets and irreducible decompositions of powers of edge ideals (Q2328153) (← links)
- Perfectly relating the domination, total domination, and paired domination numbers of a graph (Q2342631) (← links)
- Distance paired domination numbers of graphs (Q2427506) (← links)
- Total restrained domination numbers of trees (Q2463467) (← links)
- Construction for trees without domination critical vertices (Q2671102) (← links)
- Paired Domination in Graphs (Q3384606) (← links)
- Upper paired domination versus upper domination (Q5024681) (← links)