Pages that link to "Item:Q1773836"
From MaRDI portal
The following pages link to Total and paired-domination numbers of a tree (Q1773836):
Displayed 18 items.
- Efficient open domination in Cayley graphs (Q452987) (← links)
- Which trees have a differentiating-paired dominating set? (Q543501) (← 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)
- Graphs with large paired-domination number (Q867028) (← links)
- Bounds on the disjunctive total domination number of a tree (Q907839) (← links)
- A polynomial-time algorithm for the paired-domination problem on permutation graphs (Q1003667) (← links)
- On the \(k\)-limited packing numbers in graphs (Q1751194) (← links)
- Further results on packing related parameters in graphs (Q2118231) (← links)
- Paired domination in trees (Q2159733) (← links)
- Global edge alliances in graphs (Q2414475) (← links)
- On the weak Roman domination number of lexicographic product graphs (Q2420431) (← links)
- Paired-domination in generalized claw-free graphs (Q2460102) (← links)
- Paired Domination in Graphs (Q3384606) (← links)
- The diameter of paired-domination vertex critical graphs (Q3624924) (← links)
- Bounds on weak and strong total domination in graphs (Q5006580) (← links)
- Lower bounds on the total domination number of a graph (Q5963609) (← links)
- Algorithmic aspects of paired disjunctive domination in graphs (Q6100186) (← links)