文章基本信息

标题：On Rainbow Colouring of Some Graphs
本地全文：下载
作者：N.Ramya
期刊名称：International Journal of Innovative Research in Science, Engineering and Technology
印刷版ISSN：2347-6710
电子版ISSN：2319-8753
出版年度：2015
卷号：4
期号：8
页码：7091
DOI：10.15680/IJIRSET.2015.0408226
出版社：S&S Publications
摘要：A path is an edge coloured graph is said to be a rainbow path if no two edges on the path have the samecolour. An edge coloured graph is rainbow connected if there exists a rainbow path between every pair of vertices. Therainbow connectivity with connection number γc (G) is the smallest number of colours required to edge colour thegraph such that graph is rainbow connected. Here we are discussing the rainbow colouring of some graphs
关键词：Rainbow Colouring