Published August 26, 2017
| Version v1
Journal article
Open
APPLICATIONS OF EDGE COLORING OF GRAPHS WITH RAINBOW NUMBERS PHENOMENA
Authors/Creators
- 1. Professor & H.O.D, Hindu College, Guntur, (A.P.), INDIA.
- 2. Associate Professor of Mathematics & H.O.D, Rice Krishna Sai Prakasam Group of Institutions, Ongole, (A.P), INDIA
- 3. Associate Professor of Mathematics & H.O.D, Chebrolu Engineering College, Chebrolu, Guntur Dist. (A.P), INDIA
- 4. Associate Professor of Mathematics, St. Mary's Group of Institutions, Chebrolu, Guntur Dist. (A.P), INDIA
Description
This paper studies the Rainbow Ramsety Number for a non empty graph and the main results are 1. The Rainbow Ramsety Number of a graph F with out isolated vertices is defined if and only if F is a forest. 2. The Rainbow Ramsety Number of two graphs F1 and F2 with out isolated vertices is defined if and only if F1 is a star or F2 is a forest..