APPLICATIONS OF EDGE COLORING OF GRAPHS WITH RAINBOW NUMBERS PHENOMENA
DOI:
https://doi.org/10.29121/granthaalayah.v3.i12.2015.2901Keywords:
Rainbow Ramsety Number, Forest, Isolated Vertices, StarAbstract [English]
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.
Downloads
References
B.Bollobas&A.J.Harris, list colorings of graphs. Graphs combin.1(1985) 115-127
G.Chartrand, G.L.Johns, K.A.McKeon, and P.Zhang, Rainbow Connection in Graphs. Math. Bohem.
G.Chartrand, G.L.Johns, K.A.McKeon, and P.Zhang, Rainbow Connectivity of a Graphs. Networks.
C.A.Christen and S.M.Selkow, some perfect coloring properties of Graphs.
J.Combin.Theory Ser. B27 (1979) 49-59. DOI: https://doi.org/10.1016/0095-8956(79)90067-4
S.Fiorini&R.J.Wilson, edge colorings of graphs.Pitman,London (1977).
Downloads
Published
How to Cite
Issue
Section
License
With the licence CC-BY, authors retain the copyright, allowing anyone to download, reuse, re-print, modify, distribute, and/or copy their contribution. The work must be properly attributed to its author.
It is not necessary to ask for further permission from the author or journal board.
This journal provides immediate open access to its content on the principle that making research freely available to the public supports a greater global exchange of knowledge.