Independent dominating sets in regular graphs
From MaRDI portal
Publication:358646
DOI10.1007/S10878-011-9439-6zbMATH Open1275.90116OpenAlexW2091835776MaRDI QIDQ358646FDOQ358646
Authors: Julie Haviland 
Publication date: 9 August 2013
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-011-9439-6
Recommendations
Cites Work
- Two relations between the parameters of independence and irredundance
- On independent domination number of regular graphs
- On the independent domination number of regular graphs
- On minimum maximal independent sets of a graph
- Independent domination in regular graphs
- Independent sets in regular graphs
- Linear programming and the worst-case analysis of greedy algorithms on cubic graphs
Cited In (15)
- Independent perfect domination sets in Cayley graphs
- Independent domination in regular graphs
- Large hypertree width for sparse random hypergraphs
- On the independent domination number of graphs with given minimum degree
- On independent domination of regular graphs
- Independent domination in triangle-free graphs
- Upper bounds for independent domination in regular graphs
- Dominating sets for uniform subset graphs
- A note on independent domination in graphs of girth 5
- A note on the independent domination number of subset graph
- On the independent domination number of regular graphs
- A structural approach for independent domination of regular graphs
- Independent sets in quasi-regular graphs
- Independent dominating and neighborhood sets in triangular graphs
- 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)
