Upper bounds for alpha-domination parameters

Details Upper bounds for alpha-domination parameters Upper bounds for alpha-domination parameters

2008-05-05

arxiv.org/abs/0805.0612v1

Graphs Combin. 25 (2009), no. 4, pp. 513-520

Mathematics

Combinatorics

7 pages; Presented at the 4th East Coast Combinatorial Conference, Antigonish (Nova Scotia, Canada), May 1-2, 2008

Scientific paper

10.1007/s00373-009-0864-6

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.

Affiliated with

Also associated with

No associations

Rating

Upper bounds for alpha-domination parameters does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Upper bounds for alpha-domination parameters, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Upper bounds for alpha-domination parameters will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-208258