An improved upper bound on the independent domination number in cubic graphs of girth at least six

DOI10.1007/S00373-021-02446-YMaRDI QIDQ2115169zbMATHOpenAlexFDO

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

zbMATH Keywords

cubic graphsindependent domination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

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

• A note on independent sets in graphs with large minimum degree and small cliques
• Cubic graphs with large ratio of independent domination number to domination number
• Domination versus independent domination in cubic graphs
• Independent dominating sets in triangle-free graphs
• Independent domination in cubic graphs
• Independent domination in graphs: A survey and recent results
• Independent domination in subcubic bipartite graphs of girth at least six
• Independent domination in subcubic graphs of girth at least six
• On independent domination in planar cubic graphs
• On independent domination number of regular graphs
• On the independent domination number of regular graphs
• Structures of domination in graphs
• The independent domination number of a cubic 3-connected graph can be much larger than its domination number
• Topics in Domination in Graphs
• Total domination in graphs
• What is the difference between the domination and independent domination numbers of a cubic graph?

Cited in

(6)

• Independent domination in subcubic bipartite graphs of girth at least six
• A tight bound for independent domination of cubic graphs without 4‐cycles
• Best possible upper bounds on the restrained domination number of cubic graphs
• 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)