Loading...
Please wait, while we are loading the content...
Similar Documents
On 3-rainbow Domination in Petersen graphs P ( n , 2 ) and P ( n , 3 )
| Content Provider | Semantic Scholar |
|---|---|
| Author | Arul, Sharmila Mary Sivagami, P. |
| Copyright Year | 2013 |
| Abstract | The k-rainbow domination is a variant of the classical domination problem in graphs and is defined as follows: Given an undirected graph G = (V,E) and a set of k colours numbered 1, 2, . . . , k, we assign an arbitrary subset of these colours to each vertex of G. If a vertex is assigned the empty set, then the union of colour sets of its neighbours must be k colours. This assignment is called the k-rainbow dominating function of G. The minimum sum of numbers of assigned colours over all vertices of G, is called the k-rainbow domination number of G. In this paper, we present some bounds on the 3-rainbow domination number of generalized Petersen graphs P (n, 2) and P (n, 3) AMS subject classification: 05C12 |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.conference.bonfring.org/papers/vit_icmce2013/icmce119.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
