Inequality of Nordhaus-Gaddum type for total outer-connected domination in graphs
From MaRDI portal
Publication:2430322
DOI10.1007/s10114-011-9057-3zbMath1210.05100OpenAlexW2029251279MaRDI QIDQ2430322
Publication date: 6 April 2011
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-011-9057-3
Related Items
Complexity of total outer-connected domination problem in graphs ⋮ Nordhaus-gaddum type inequalities for tree covering numbers on unitary cayley graphs of finite rings ⋮ Generalization of the total outer-connected domination in graphs
Cites Work
- Domination number in graphs with minimum degree two
- Total domination and total domination subdivision number of a graph and its complement
- Total outer-connected domination numbers of trees
- Paired-domination number of a graph and its complement
- Restrained domination in graphs
- Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs
- On Complementary Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item