Pages that link to "Item:Q998404"
From MaRDI portal
The following pages link to Paired-domination number of a graph and its complement (Q998404):
Displayed 4 items.
- An upper bound on the paired-domination number in terms of the number of edges in the graph (Q710582) (← links)
- Paired-domination subdivision numbers of graphs (Q844217) (← links)
- Inequality of Nordhaus-Gaddum type for total outer-connected domination in graphs (Q2430322) (← links)
- Graphs with maximum size and given paired-domination number (Q2449089) (← links)