The following pages link to (Q5461697):
Displayed 13 items.
- Which trees have a differentiating-paired dominating set? (Q543501) (← links)
- \(k\)-domination and \(k\)-independence in graphs: A survey (Q659765) (← links)
- An upper bound on the paired-domination number in terms of the number of edges in the graph (Q710582) (← links)
- Upper paired-domination in claw-free graphs (Q719019) (← links)
- Double domination in lexicographic product graphs (Q777395) (← links)
- Graphs with large paired-domination number (Q867028) (← links)
- Some matching properties in \(4-\gamma_{\times 2}\)-critical graphs (Q980258) (← links)
- Vertices contained in all or in no minimum paired-dominating set of a tree (Q995930) (← links)
- Paired versus double domination in \(K_{1,r}\)-free graphs (Q2015806) (← links)
- Paired-domination in generalized claw-free graphs (Q2460102) (← links)
- Characterizations of trees with equal paired and double domination numbers (Q2501557) (← links)
- The diameter of paired-domination vertex critical graphs (Q3624924) (← links)
- On the packing numbers in graphs (Q4614038) (← links)