The server is under maintenance between 08:00 to 12:00 (GMT+08:00), and please visit later.
We apologize for any inconvenience caused
Login  | Sign Up  |  Oriprobe Inc. Feed
China/Asia On Demand
Journal Articles
Laws/Policies/Regulations
Companies/Products
Bookmark and Share
Upper bounds on the 3-rainbow domination number of trees
Author(s): 
Pages: 210-220
Year: Issue:  2
Journal: Pure and Applied Mathematics

Keyword:  treedomination numberrainbow domination number;
Abstract: This paper studies 3-rainbow domination number of trees. First we give an upper bound for the 3-rainbow domination number of trees with small Geter by the construction method. Second, we give an upper bound on the 3-rainbow domination number of trees with order n equaling or greater than 5 by induction and the idea of classification discussion.
Related Articles
No related articles found