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-YzbMATH Open1484.05148OpenAlexW4210604868MaRDI QIDQ2115169FDOQ2115169
Authors: 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
Recommendations
- Independent domination in subcubic graphs of girth at least six
- Independent domination in subcubic bipartite graphs of girth at least six
- A tight bound for independent domination of cubic graphs without 4‐cycles
- A note on independent domination in graphs of girth 6
- Independent domination in bipartite cubic graphs
Cites Work
- Total domination in graphs
- Independent domination in graphs: A survey and recent results
- On independent domination number of regular graphs
- On the independent domination number of regular graphs
- On independent domination in planar cubic graphs
- Cubic graphs with large ratio of independent domination number to domination number
- Independent domination in cubic graphs
- Domination versus independent domination in cubic graphs
- 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 dominating sets in triangle-free graphs
- A note on independent sets in graphs with large minimum degree and small cliques
- Independent domination in subcubic bipartite graphs of girth at least six
- Topics in Domination in Graphs
- Structures of domination in graphs
- Independent domination in subcubic graphs of girth at least six
Cited In (6)
- Best possible upper bounds on the restrained domination number of cubic graphs
- A tight bound for independent domination of cubic graphs without 4‐cycles
- Independent domination in subcubic bipartite graphs of girth at least six
- Independent domination in subcubic graphs of girth at least six
- Counting maximal independent sets in some \(n\)-gonal cacti
- Counting independent sets in cubic graphs of given girth
This page was built for publication: An improved upper bound on the independent domination number in cubic graphs of girth at least six
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2115169)
