Independent domination in subcubic bipartite graphs of girth at least six

DOI10.1016/J.DAM.2013.08.035MaRDI QIDQ741773zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

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

Cites work

• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• Domination in Cubic Graphs of Large Girth
• 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
• Independent domination in graphs: A survey and recent results
• On independent domination number of regular graphs
• On the independent domination number of regular graphs

Cited in

(15)

• My favorite domination conjectures in graph theory are bounded
• The domination and independence of some cubic bipartite graphs
• The inverse domination number and independence number of some cubic bipartite graphs
• An improved upper bound on the independent domination number in cubic graphs of girth at least six
• A tight bound for independent domination of cubic graphs without 4‐cycles
• A note on connected bipartite graphs having independent domination number half their order.
• \( K_{1 , 2}\)-isolation in graphs
• Independent domination in subcubic graphs
• A note on independent domination in graphs of girth 6
• Independent domination in bipartite cubic graphs
• Independent set dominating sets in bipartite graphs
• On independent domination in planar cubic graphs
• Independent domination in subcubic graphs of girth at least six
• Broadcast domination in subcubic graphs
• Gated independence in graphs

This page was built for publication: Independent domination in subcubic bipartite 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 Q741773)