On the ratios between packing and domination parameters of a graph
From MaRDI portal
Publication:1025506
DOI10.1016/j.disc.2008.05.030zbMath1211.05103OpenAlexW2019115544MaRDI QIDQ1025506
Michael A. Henning, Alewyn P. Burger, Jan H. van Vuuren
Publication date: 19 June 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.05.030
Related Items
\(k\)-tuple total domination in cross products of graphs ⋮ Dominating sets, packings, and the maximum degree ⋮ Open- and closed-loop dissipation inequalities under sampling and controller emulation ⋮ Irredundance ⋮ The probabilistic approach to limited packings in graphs
Cites Work
- Irredundance number versus domination number
- Relations between packing and covering numbers of a tree
- The sequence of upper and lower domination, independence and irredundance numbers of a graph
- The rati of the irredundance and domination number of a graph
- Graph-theoretic parameters concerning domination, independence, and irredundance
- Stability, domination and irredundance in a graph
- Properties of Hereditary Hypergraphs and Middle Graphs
- The ratio of the irredundance number and the domination number for block-cactus graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
