Mathematics – Combinatorics
Scientific paper
2009-01-19
Mathematics
Combinatorics
12 pages
Scientific paper
In this paper, we present new upper bounds for the global domination and Roman domination numbers and also prove that these results are asymptotically best possible. Moreover, we give upper bounds for the restrained domination and total restrained domination numbers for large classes of graphs, and show that, for almost all graphs, the restrained domination number is equal to the domination number, and the total restrained domination number is equal to the total domination number. A number of open problems are posed.
Poghosyan Anush
Zverovich Vadim
No associations
LandOfFree
On Roman, Global and Restrained Domination in Graphs 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 On Roman, Global and Restrained Domination in Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Roman, Global and Restrained Domination in Graphs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-566794