Pages that link to "Item:Q2060245"
From MaRDI portal
The following pages link to Bounds on the paired domination number of graphs with minimum degree at least three (Q2060245):
Displaying 10 items.
- An upper bound on the paired-domination number in terms of the number of edges in the graph (Q710582) (← links)
- Graphs with large paired-domination number (Q867028) (← links)
- Paired-domination number of a graph and its complement (Q998404) (← links)
- Upper bounds on the paired-domination number (Q1003575) (← links)
- Combinatorial bounds on paired and multiple domination in triangulations (Q1792065) (← links)
- Bounds on the semipaired domination number of graphs with minimum degree at least two (Q2025082) (← links)
- Bounds on domination parameters in graphs: a brief survey (Q2151205) (← links)
- Upper bounds for the paired-domination numbers of graphs (Q2631089) (← links)
- A note on the upper bound for the paired-domination number of a graph with minimum degree at least two (Q3082598) (← links)
- Partial domination and irredundance numbers in graphs (Q6096253) (← links)