Inequality of Nordhaus-Gaddum type for total outer-connected domination in graphs

DOI10.1007/s10114-011-9057-3zbMath1210.05100OpenAlexW2029251279MaRDI QIDQ2430322

Hongxing Jiang, Li-ying Kang

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

zbMATH Keywords

graphdomination numbertotal outer-connected dominationNordhaus-Gaddum inequality

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

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