Domination versus independent domination in cubic graphs
From MaRDI portal
Publication:385388
DOI10.1016/J.DISC.2012.01.003zbMATH Open1277.05129OpenAlexW2031662678MaRDI QIDQ385388FDOQ385388
Authors: Justin Southey, Michael A. Henning 
Publication date: 2 December 2013
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2012.01.003
Recommendations
- Independent domination in subcubic graphs
- Independent domination in cubic graphs
- Cubic graphs with large ratio of independent domination number to domination number
- The independent domination number of a cubic 3-connected graph can be much larger than its domination number
- Total domination versus domination in cubic graphs
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Towards a theory of domination in graphs
- On independent domination number of regular graphs
- On the independent domination number of regular graphs
- Title not available (Why is that?)
- The independent domination number of a cubic 3-connected graph can be much larger than its domination number
- What is the difference between the domination and independent domination numbers of a cubic graph?
- Independent domination in regular graphs
- An upper bound for the independent domination number
- Disproof of a conjecture in the domination theory
- Triangle-free graphs with large independent domination number
- A counterexample to conjecture of Barefoot, Harary, and Jones
- Upper bounds for independent domination in regular graphs
- Independent dominating sets and hamiltonian cycles
- Independent dominating sets in triangle-free graphs
- Title not available (Why is that?)
Cited In (26)
- On domination in Hamiltonian cubic graphs
- Best possible upper bounds on the restrained domination number of cubic graphs
- The domination and independence of some cubic bipartite graphs
- The inverse domination number and independence number of some cubic bipartite graphs
- On independent and \((d, n)\)-domination numbers of hypercubes
- An improved upper bound on the independent domination number in cubic graphs of girth at least six
- Title not available (Why is that?)
- A tight bound for independent domination of cubic graphs without 4‐cycles
- Total domination versus domination in cubic graphs
- Cubic graphs with large ratio of independent domination number to domination number
- On independent domination of regular graphs
- A Note on Isolate Domination Number of a Cubic Graph
- Independent domination versus packing in subcubic graphs
- On the ratio of the domination number and the independent domination number in graphs
- On (1,2)-domination in cubic graphs
- The domination parameters of cubic graphs
- The extremal average distance of cubic graphs
- Independent domination in subcubic graphs
- The independent domination numbers of strong product of two cycles
- Independent domination in cubic graphs
- Independent domination in bipartite cubic graphs
- Domination versus independent domination in regular graphs
- On independent domination in planar cubic graphs
- Vertex-edge domination in cubic graphs
- Domination versus independent domination in graphs of small regularity
- Independent domination in subcubic graphs of girth at least six
This page was built for publication: Domination versus independent domination in cubic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q385388)
