Dominating sets, packings, and the maximum degree

DOI10.1016/j.disc.2011.04.030zbMath1230.05225OpenAlexW1979518281MaRDI 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

zbMATH Keywords

coveringpackingclaw-free graphdomination

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

Graphs with unique maximum packing of closed neighborhoods ⋮ (Open) packing number of some graph products ⋮ The probabilistic approach to limited packings in graphs

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Dominating sets, packings, and the maximum degree