On the outer-connected domination in graphs

DOI10.1007/S10878-011-9427-XzbMATH Open1275.90111OpenAlexW2081719370MaRDI QIDQ358644FDOQ358644

Authors Mohammad Hadi Akhbari, Roslan Hasni, Odile Favaron, Hossein Karami, Seyed Mahmood 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)

Recommendations

• Outer-connected domination upon edge removal in graphs
• The outer-connected domination number of a graph
• scientific article; zbMATH DE number 5823716
• Global outer connected domination number of a graph
• On the total outer-connected domination in graphs

Cites Work

• scientific article; zbMATH DE number 5823716 (Why is no real title available?)
• scientific article; zbMATH DE number 3172309 (Why is no real title available?)
• Domination-balanced graphs
• The outer-connected domination number of a graph

Cited In (26)

• Title not available (Why is no real title available?)
• Outer-connected 2-dominating sets of graphs
• Outer-2-independent domination in graphs
• A greedy algorithm for the fault-tolerant outer-connected dominating set problem
• Domination and outer connected domination in maximal outerplanar graphs
• Outer-\(k\)-connected component domination in graphs
• Outer-connected domination in 2-connected cubic graphs
• The outer-connected domination number of Sierpiński-like graphs
• Outer-connected domination upon edge removal in graphs
• The outer-connected domination number of a graph
• Global outer connected domination number of a graph
• PBIB-designs with \(m= 1, 2, 3, 4\) and \(\lfloor\frac{p}{2}\rfloor\) associated classes arising from \(\gamma_{cc}\)-sets of some special kind of graphs
• On connected cutfree domination in graphs
• Computing a minimum outer-connected dominating set for the class of chordal graphs
• On the number of outer connected dominating sets of graphs
• Outer-weakly convex domination number of graphs
• Total outer-connected domination in trees
• Outer-convex domination in graphs
• Finding outer-connected dominating sets in interval graphs
• Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs
• Criticality of outer-connected independence upon edge removal
• Complexity of total outer-connected domination problem in graphs
• On the complexity of the minimum outer-connected dominating set problem in graphs
• The Outer-Paired Domination of Graphs
• Tractable connected domination for restricted bipartite graphs
• On the complexity of the outer-connected bondage and the outer-connected reinforcement problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q358644)