تعداد نشریات | 162 |
تعداد شمارهها | 6,578 |
تعداد مقالات | 71,072 |
تعداد مشاهده مقاله | 125,700,199 |
تعداد دریافت فایل اصل مقاله | 98,934,450 |
Edge pair sum labeling of some cycle related graphs | ||
Journal of Algorithms and Computation | ||
مقاله 4، دوره 48، شماره 1، اسفند 2016، صفحه 57-68 اصل مقاله (704.25 K) | ||
نوع مقاله: Research Paper | ||
شناسه دیجیتال (DOI): 10.22059/jac.2016.7940 | ||
نویسندگان | ||
P. Jeyanthi* 1؛ T. Saratha Devi2 | ||
1Govindammal Aditanar College for Women Tiruchendur-628 215, Tamil Nadu, India | ||
2Department of Mathematics, G.Venkataswamy Naidu College, Kovilpatti-628502,Tamilnadu,India. | ||
چکیده | ||
Let G be a (p,q) graph. An injective map f : E(G) → {±1,±2,...,±q} is said to be an edge pair sum labeling if the induced vertex function f*: V (G) → Z - {0} defined by f*(v) = ΣP∈Ev f (e) is one-one where Ev denotes the set of edges in G that are incident with a vertex v and f*(V (G)) is either of the form {±k1,±k2,...,±kp/2} or {±k1,±k2,...,±k(p-1)/2} U {±k(p+1)/2} according as p is even or odd. A graph with an edge pair sum labeling is called an edge pair sum graph. In this paper we prove that the graphs GL(n), double triangular snake D(Tn), Wn, Fln, <Cm,K1,n> and <Cm * K1,n> admit edge pair sum labeling. | ||
کلیدواژهها | ||
Edge pair sum labeling؛ edge pair sum graph؛ double triangular snake؛ wheel graph؛ ower graph | ||
آمار تعداد مشاهده مقاله: 1,737 تعداد دریافت فایل اصل مقاله: 1,075 |