2000 character limit reached
Upper bounds for alpha-domination parameters (0805.0612v1)
Published 5 May 2008 in math.CO and cs.DM
Abstract: In this paper, we provide a new upper bound for the alpha-domination number. This result generalises the well-known Caro-Roditty bound for the domination number of a graph. The same probabilistic construction is used to generalise another well-known upper bound for the classical domination in graphs. We also prove similar upper bounds for the alpha-rate domination number, which combines the concepts of alpha-domination and k-tuple domination.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.