Upper bounds for alpha-domination parameters
Combinatorics
2010-12-24 v1 Discrete Mathematics
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.
Keywords
Cite
@article{arxiv.0805.0612,
title = {Upper bounds for alpha-domination parameters},
author = {Andrei Gagarin and Anush Poghosyan and Vadim E. Zverovich},
journal= {arXiv preprint arXiv:0805.0612},
year = {2010}
}
Comments
7 pages; Presented at the 4th East Coast Combinatorial Conference, Antigonish (Nova Scotia, Canada), May 1-2, 2008