Independent dominating sets in regular graphs
From MaRDI portal
Recommendations
Cites work
- Independent domination in regular graphs
- Independent sets in regular graphs
- Linear programming and the worst-case analysis of greedy algorithms on cubic graphs
- On independent domination number of regular graphs
- On minimum maximal independent sets of a graph
- On the independent domination number of regular graphs
- Two relations between the parameters of independence and irredundance
Cited in
(20)- Independent dominating and neighborhood sets in triangular graphs
- On independent domination of regular graphs
- Independent dominating sets in graphs of girth five
- Irregular independence and irregular domination
- Large hypertree width for sparse random hypergraphs
- Upper bounds for independent domination in regular graphs
- Independent domination of graphs with bounded maximum degree
- Domination versus independent domination in regular graphs
- Independent sets in quasi-regular graphs
- Independent domination in regular graphs
- On the independent domination number of graphs with given minimum degree
- Domination versus independent domination in graphs of small regularity
- Dominating sets for uniform subset graphs
- Independent domination in triangle-free graphs
- On the independent domination number of regular graphs
- A note on independent domination in graphs of girth 5
- A structural approach for independent domination of regular graphs
- Independent perfect domination sets in Cayley graphs
- A note on the independent domination number of subset graph
- Independent dominating sets in triangle-free graphs
This page was built for publication: Independent dominating sets in regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q358646)
