A structural approach for independent domination of regular graphs
From MaRDI portal
Publication:497353
DOI10.1007/s00373-014-1454-9zbMath1327.05167OpenAlexW2007911652MaRDI QIDQ497353
Publication date: 24 September 2015
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-014-1454-9
Related Items (2)
Domination versus independent domination in graphs of small regularity ⋮ Independent domination in subcubic graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Independent dominating sets in regular graphs
- Gromov hyperbolic graphs
- Linear programming and the worst-case analysis of greedy algorithms on cubic graphs
- The independent domination number of a cubic 3-connected graph can be much larger than its domination number
- Two relations between the parameters of independence and irredundance
- Disjoint independent dominating sets in graphs
- Coverings by minimal transversals
- On independent domination number of regular graphs
- On the independent domination number of regular graphs
- Independent sets in regular graphs
- Upper bounds for independent domination in regular graphs
- On hitting all maximum cliques with an independent set
- On the Independent Domination Number of Random Regular Graphs
- A Note on "The Comparability Graph of a Tree"
This page was built for publication: A structural approach for independent domination of regular graphs
