An improved upper bound on the independent domination number in cubic graphs of girth at least six
From MaRDI portal
Publication:2115169
DOI10.1007/s00373-021-02446-yzbMath1484.05148OpenAlexW4210604868MaRDI QIDQ2115169
G. Abrishami, Michael A. Henning
Publication date: 15 March 2022
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-021-02446-y
Related Items (2)
Counting maximal independent sets in some \(n\)-gonal cacti ⋮ A tight bound for independent domination of cubic graphs without 4‐cycles
Cites Work
- 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
- On independent domination in planar cubic graphs
- Independent domination in subcubic graphs of girth at least six
- Independent Domination in Cubic Graphs
- Total Domination in Graphs
- Structures of Domination in Graphs
- Topics in Domination in Graphs
This page was built for publication: An improved upper bound on the independent domination number in cubic graphs of girth at least six
