文章基本信息

标题：On Lucky Edge Labeling of Some Graphs
本地全文：下载
作者：N.Ramya ; R.Shalini
期刊名称：International Journal of Innovative Research in Science, Engineering and Technology
印刷版ISSN：2347-6710
电子版ISSN：2319-8753
出版年度：2015
卷号：4
期号：9
页码：8146
DOI：10.15680/IJIRSET.2015.0409178
出版社：S&S Publications
摘要：Let G be a simple graph with vertex set V(G) and edge set E(G) respectively. Vertex set V(G) islabeled arbitrary by positive integers. And edge set E(G) denote the edge label suchthat it is the sum of labels ofvertices incident with edge e. The labeling is said to be lucky edge labeling if the edge set E(G) is a proper coloring ofG, that is if we have E(e1)≠E(e2) whenever e1 and e2 are adjacent edges. The least integer k for which a graph G has alucky edge labeling from the set {1,2,…k.}is the lucky number of G denoted by η(G).A graph which admits lucky edge labeling is the lucky edge labeled graph. In this paper ,it is proved lucky edgelabeling of certain classes of graphs.
关键词：Lucky edge labeled graph lucky edge labeling; Lucky number