Independent dominating sets in regular graphs
From MaRDI portal
Publication:358646
DOI10.1007/s10878-011-9439-6zbMath1275.90116OpenAlexW2091835776MaRDI QIDQ358646
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
Related Items
Dominating sets for uniform subset graphs, A structural approach for independent domination of regular graphs, Large hypertree width for sparse random hypergraphs
Cites Work
- Linear programming and the worst-case analysis of greedy algorithms on cubic graphs
- Two relations between the parameters of independence and irredundance
- On minimum maximal independent sets of a graph
- On independent domination number of regular graphs
- Independent domination in regular graphs
- On the independent domination number of regular graphs
- Independent sets in regular graphs