On the outer-connected domination in graphs

DOI10.1007/S10878-011-9427-XzbMath1275.90111OpenAlexW2081719370MaRDI QIDQ358644

M. H. Akhbari, Hossein Karami, Roslan Hasni, Odile Favaron, Seyyed Mahmoud Sheikholeslami

Publication date: 9 August 2013

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

Full work available at URL: https://doi.org/10.1007/s10878-011-9427-x

zbMATH Keywords

diameterouter-connected dominating setouter-connected domination number

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (14)

Outer-weakly convex domination number of graphs ⋮ Outer-connected domination in 2-connected cubic graphs ⋮ Complexity of total outer-connected domination problem in graphs ⋮ The Outer-Paired Domination of Graphs ⋮ Unnamed Item ⋮ Computing a minimum outer-connected dominating set for the class of chordal graphs ⋮ Finding outer-connected dominating sets in interval graphs ⋮ A greedy algorithm for the fault-tolerant outer-connected dominating set problem ⋮ On the complexity of the outer-connected bondage and the outer-connected reinforcement problems ⋮ On the complexity of the minimum outer-connected dominating set problem in graphs ⋮ Domination and outer connected domination in maximal outerplanar graphs ⋮ OUTER-CONNECTED 2-DOMINATING SETS OF GRAPHS ⋮ The outer-connected domination number of Sierpiński-like graphs ⋮ Tractable connected domination for restricted bipartite graphs

Cites Work

• Domination-balanced graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

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