Elegant labeling of some graphs and their line graphs
Downloads
An elegant labeling f of graph G with ‘ q ’ edges an injective function from the vertices of G to the set {0, 1 , 2,------- q} such that when each edge ( e = xy ) is assigned the label { ( f (x) + f (y) ) mod( q + 1) } the resulting edge labels are distinct and non zero. In this paper it is shown to be certain families of line graphs of elegant graphs are elegant graphs.
A.Elumalai and G.Sethuraman, Elegant labeled graphs,Jinform.Math.Sci.,2(2010) 45-49.
C. J. Chang, D. F. Hsu and D. G. Rogers, congressusNumerantium .32(1981),181-97.
GrayChatrand,PingZhang,Introduction to graph theory,McGraw-Hill International Edition.
I.Cahit,Elegantvalution of the paths,Ars Combin.,16 (1983)223-227.
Joseph A. Gallian ‘A Dynamic Survey of graphlabeling’ 7th edition ,Dec 29,2014.
P.Deb and N.B.Limaye,On elegant Labelings of triangluarSnakes,J.Combin.Inform.System
Sci.,25(2000)163-172.
P.Deb and N.B.Limaye,On harmonious labelings of some cycle related graphs,Ars
combin.,65(2002)177-197.
R Balakrishnan and R. Sampathkumar, utilitas Mathematics 46 (1994 ),97-102.
R Balakrishnan, A. Selvam and V.Yegnanrayanan ‘Some results on elegant graphs’IndianJ.Pure
appl.math,28(7):905-916,July 1997 10) V. Laxmi, Alias Gomathi, N murugan and A.Nagarajan ‘Some results on elegant graphs’
international Journal of mathematical Archive-3(3),2012,pages-1017-1028
All Content should be original and unpublished.