Independent domination in subcubic bipartite graphs of girth at least six

DOI10.1016/j.dam.2013.08.035zbMath1300.05225OpenAlexW2067689334MaRDI QIDQ741773

Dieter Rautenbach, Christian Löwenstein, Michael A. Henning

Publication date: 12 September 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.08.035

zbMATH Keywords

cubic graphsindependent domination

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (9)

Independent domination in subcubic graphs of girth at least six ⋮ A tight bound for independent domination of cubic graphs without 4‐cycles ⋮ \( K_{1 , 2}\)-isolation in graphs ⋮ Independent domination in bipartite cubic graphs ⋮ On independent domination in planar cubic graphs ⋮ Independent domination in subcubic graphs ⋮ My Favorite Domination Conjectures in Graph Theory Are Bounded ⋮ 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
• Unnamed Item
• On independent domination number of regular graphs
• On the independent domination number of regular graphs
• Independent domination in graphs: A survey and recent results
• Domination in graphs of minimum degree at least two and large girth
• Domination number of cubic graphs with large girth
• Independent Domination in Cubic Graphs
• Domination in Cubic Graphs of Large Girth

This page was built for publication: Independent domination in subcubic bipartite graphs of girth at least six