Outer-k-connected component domination in graphs
From MaRDI portal
Publication:656132
zbMATH Open1241.05106MaRDI QIDQ656132FDOQ656132
Authors: Mohammad Hadi Akhbari, Nader Jafari Rad, Changiz Eslahchi, Roslan Hasni 
Publication date: 26 January 2012
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Recommendations
- scientific article
- On the outer-connected domination in graphs
- On the total outer-connected domination in graphs
- Generalization of the total outer-connected domination in graphs
- Domination and outer connected domination in maximal outerplanar graphs
- Connected domination in maximal outerplanar graphs
- On the number of outer connected dominating sets of graphs
- The outer-connected domination number of a graph
- Outer-convex domination in graphs
- Complexity of total outer-connected domination problem in graphs
Cited In (11)
- Title not available (Why is that?)
- Outer-connected domination in 2-connected cubic graphs
- The outer-connected domination number of Sierpiński-like graphs
- The outer-connected domination number of a graph
- An exceptional invariant $k$-component order neighbor connectivity -- a generalization of domination alteration sets in graphs
- Global outer connected domination number of a graph
- Generalization of the total outer-connected domination in graphs
- On the number of outer connected dominating sets of graphs
- Dominating sets inducing large components in maximal outerplanar graphs
- Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs
- On the complexity of the outer-connected bondage and the outer-connected reinforcement problems
This page was built for publication: Outer-\(k\)-connected component domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q656132)
