Independent domination in subcubic graphs of girth at least six
From MaRDI portal
Publication:2411611
DOI10.1016/j.disc.2017.08.025zbMath1372.05154OpenAlexW2756163709MaRDI QIDQ2411611
Michael A. Henning, G. Abrishami
Publication date: 24 October 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2017.08.025
Related Items (7)
On independent domination of regular graphs ⋮ Counting maximal independent sets in some \(n\)-gonal cacti ⋮ A tight bound for independent domination of cubic graphs without 4‐cycles ⋮ 2-limited broadcast domination in subcubic graphs ⋮ Independent domination in subcubic graphs ⋮ Broadcast domination in subcubic graphs ⋮ An improved upper bound on the independent domination number in cubic graphs of girth at least six
Cites Work
- Unnamed Item
- Cubic graphs with large ratio of independent domination number to domination number
- Domination versus independent domination in cubic graphs
- A note on independent sets in graphs with large minimum degree and small cliques
- Independent dominating sets in triangle-free graphs
- The independent domination number of a cubic 3-connected graph can be much larger than its domination number
- Independent domination in subcubic bipartite graphs of girth at least six
- What is the difference between the domination and independent domination numbers of a cubic graph?
- On independent domination number of regular graphs
- On the independent domination number of regular graphs
- Independent domination in graphs: A survey and recent results
- Independent Domination in Cubic Graphs
- Total Domination in Graphs
This page was built for publication: Independent domination in subcubic graphs of girth at least six
