Open AccessAPPLICATIONS OF EDGE COLORING OF GRAPHS WITH RAINBOW NUMBERS PHENOMENA
Author(s) -
B. Ramireddy,
Mohan Bahadur Chand,
Sri Krishna Chaitanya,
B.R. Srinivas
Publication year - 2015
Publication title -
international journal of research - granthaalayah
Language(s) - English
Resource type - Journals
eISSN - 2394-3629
pISSN - 2350-0530
DOI - 10.29121/granthaalayah.v3.i12.2015.2901
Subject(s) - rainbow , combinatorics , edge coloring , mathematics , graph , discrete mathematics , graph power , line graph , physics , optics
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.