Independent domination in subcubic graphs
From MaRDI portal
Publication:2075456
DOI10.1007/s10878-021-00743-zzbMath1482.05247arXiv2001.02946OpenAlexW3157746251MaRDI QIDQ2075456
Publication date: 14 February 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.02946
Related Items (3)
On independent domination of regular graphs ⋮ Closed formulas for the independent (Roman) domination number of rooted product graphs ⋮ Independent domination of graphs with bounded maximum degree
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
- A structural approach for independent domination of regular graphs
- The independent domination number of a cubic 3-connected graph can be much larger than its domination number
- On the ratio of the domination number and the independent domination number in graphs
- Independent domination in subcubic bipartite graphs of girth at least six
- On independent domination number of regular graphs
- Independent domination in regular graphs
- On the independent domination number of regular graphs
- Independent domination in graphs: A survey and recent results
- Independent domination in bipartite cubic graphs
- Independent domination in subcubic graphs of girth at least six
- A note on the independent domination number in graphs
- Upper bounds for independent domination in regular graphs
- Independent Domination in Cubic Graphs
- Total Domination in Graphs
- A note on the independent domination number versus the domination number in bipartite graphs
This page was built for publication: Independent domination in subcubic graphs
