On the total outer-connected domination in graphs
From MaRDI portal
Publication:2015786
DOI10.1007/S10878-012-9531-6zbMATH Open1291.90284OpenAlexW1981962330MaRDI QIDQ2015786FDOQ2015786
Authors: Odile Favaron, Hossein Karami, Seyed Mahmood 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
Recommendations
Cites Work
- The outer-connected domination number of a graph
- Total domination in graphs
- Title not available (Why is that?)
- Total outer-connected domination in trees
- 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
Cited In (17)
- Title not available (Why is that?)
- On the outer-connected domination in graphs
- Outer-\(k\)-connected component domination in graphs
- A note on the total outer-connected domination number of a tree
- Title not available (Why is that?)
- Total outer-connected domination numbers of trees
- The outer-connected domination number of Sierpiński-like graphs
- Generalization of the total outer-connected domination in graphs
- Total outer-connected domination subdivision numbers in graphs
- Outer-weakly convex domination number of graphs
- Total outer-connected domination in trees
- Finding outer-connected dominating sets in interval graphs
- Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs
- Domination and its variants in split graphs \(-\text{P}\) versus NPC dichotomy
- Complexity of total outer-connected domination problem in graphs
- On the complexity of the minimum outer-connected dominating set problem in graphs
- Inequality of Nordhaus-Gaddum type for total outer-connected domination in graphs
This page was built for publication: On the total outer-connected domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2015786)
