Upper bounds for independent domination in regular graphs
From MaRDI portal
Publication:2455589
DOI10.1016/j.disc.2007.01.001zbMath1127.05072MaRDI QIDQ2455589
Publication date: 25 October 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.01.001
05C35: Extremal problems in graph theory
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Cites Work
- Two relations between the parameters of independence and irredundance
- On the product of upper irredundance numbers of a graph and its complement
- The product of the independent domination numbers of a graph and its complement
- On minimum maximal independent sets of a graph
- On independent domination number of regular graphs
- An upper bound for the independent domination number
- Nordhaus--Gaddum bounds for independent domination
- On a Nordhaus-Gaddum type problem for independent domination
- Independent domination in regular graphs