A Review on Rainbow Edge Colouring and
Rainbow Domination

S.Nagalakshmi; S.Maivizhiselv

doi:https://doi.org/10.14445/22315373/IJMTT-V44P510

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 44 | Number 1 | Year 2017 | Article Id. IJMTT-V44P510 | DOI : https://doi.org/10.14445/22315373/IJMTT-V44P510

A Review on Rainbow Edge Colouring and Rainbow Domination

S.Nagalakshmi, S.Maivizhiselv

Citation :

S.Nagalakshmi, S.Maivizhiselv, "A Review on Rainbow Edge Colouring and Rainbow Domination," International Journal of Mathematics Trends and Technology (IJMTT), vol. 44, no. 1, pp. 53-57, 2017. Crossref, https://doi.org/10.14445/22315373/IJMTT-V44P510

Abstract

In graph theory Edge coloured graph which has the distinct coloured edges are well studied.An Edge coloured graph is t-tolerant if it contains no monochromatic star with t+1 edges.In this paper we consider optimal edge coloured complete graphs.We show that in any optimal edge colouring of the complete graph kn ,Also we prove that in every proper edge colouring of the complete graph kn .

Keywords

Rainbow Cycle, edge coloring , edge chromatic number ,Hamilton cycle.

References

[1] M. Albert, A. Freize, B. Reed, Multicoloured Hamilton cycles, Electron. J. Comb. research paper 10, 1995.
[2] N. Alon. Transversal numbers of uniform hypergraphs. Graphs and Combinatorics, vol. 6, pp.1{4, 1990.
[3] N. Alon, G. Gutin, Properly colored Hamilton Cycles in edge colored complete graphs, Random Structures Algorithms 11 (1997) No. 2, 179-186.
[4 ] J. Bos& Decompositions of graphs, Vol. 47 in Mathematics and Its Applications, Kluwer Academic Publishers (1990).
[5] R. J. Faudree, A. Gykfis, L. Lesniak, and R. H. Schelp, Rainbow coloring of the cube, J.Graph Theory 17 (19931, 607-612.
[6 ] R. J. Faudree, A. Gykfas, and T. Szonyi, Projective spaces and colorings of K,,, x K,, Coll. Math. Soc. J. Bolyai 60, Sets Graphs and Numbers (1991), 273-278.
[7] [Chakraborty et al., 2009] Chakraborty, S., Fischer, E., Matsliah, A., and Yuster, R.(2009). Hardness and algorithms for rainbow connection. Journal of Combinatorial Optimization, pages 1–18.
[8] A. M. Frieze, B. A. Reed, Polychromatic Hamilton cycles, Disc. Math. 118 (1993) 67-54.