On the total outer-connected domination in graphs

DOI10.1007/S10878-012-9531-6zbMath1291.90284OpenAlexW1981962330MaRDI QIDQ2015786

Hossein Karami, Odile Favaron, Seyyed Mahmoud Sheikholeslami

Publication date: 24 June 2014

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-012-9531-6

zbMATH Keywords

diametertotal outer-connected domination numbertotal outer-connected dominating set

Mathematics Subject Classification ID

Dynamic programming (90C39)

Related Items (3)

Complexity of total outer-connected domination problem in graphs ⋮ Domination and its variants in split graphs \(-\text{P}\) versus NPC dichotomy ⋮ On the complexity of the minimum outer-connected dominating set problem in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• A note on the total outer-connected domination number of a tree
• Total outer-connected domination numbers of trees
• On the doubly connected domination number of a graph
• Total outer-connected domination in trees
• Total domination in graphs

This page was built for publication: On the total outer-connected domination in graphs