Location of Repository

Upper Bounds for α-Domination Parameters

By A. Gagarin, A. Poghosyan and V. E. Zverovich

Abstract

In this paper, we provide a new upper bound for the α-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 α-rate domination number, which combines the concepts of α-domination and k-tuple domination

Topics: Graph, Domination, α-Domination, α-Rate Domination
OAI identifier: oai:CiteSeerX.psu:10.1.1.313.2219
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://arxiv.org/pdf/0805.0612... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.