Dominating sets, packings, and the maximum degree
From MaRDI portal
Publication:641164
DOI10.1016/j.disc.2011.04.030zbMath1230.05225MaRDI QIDQ641164
Christian Löwenstein, Dieter Rautenbach, Michael A. Henning
Publication date: 21 October 2011
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.04.030
05C35: Extremal problems in graph theory
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Graphs with unique maximum packing of closed neighborhoods, The probabilistic approach to limited packings in graphs, (Open) packing number of some graph products
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the ratios between packing and domination parameters of a graph
- Irredundance number versus domination number
- Relations between packing and covering numbers of a tree
- The rati of the irredundance and domination number of a graph
- The ratio of the irredundance number and the domination number for block-cactus graphs
- Paths, Stars and the Number Three