Domination parameters of a graph and its complement
From MaRDI portal
Publication:1692643
DOI10.7151/dmgt.2002zbMath1377.05139OpenAlexW2727875481MaRDI QIDQ1692643
Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning
Publication date: 10 January 2018
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2002
Related Items (3)
Bounds for complete cototal domination number of Cartesian product graphs and complement graphs ⋮ Restrained domination in self-complementary graphs ⋮ Connected Domination
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On graphs for which the connected domination number is at most the total domination number
- Connected domination number of a graph and its complement
- A survey of selected recent results on total domination in graphs
- Construction of strongly connected dominating sets in asymmetric multihop wireless networks
- Every planar map is four colorable
- Connected Domination and Spanning Trees with Many Leaves
- Total Domination in Graphs
This page was built for publication: Domination parameters of a graph and its complement