تعداد نشریات | 158 |
تعداد شمارهها | 6,230 |
تعداد مقالات | 67,765 |
تعداد مشاهده مقاله | 115,203,784 |
تعداد دریافت فایل اصل مقاله | 89,952,107 |
Edge pair sum labeling of spider graph | ||
Journal of Algorithms and Computation | ||
مقاله 3، دوره 45، شماره 1، اسفند 2014، صفحه 25-34 اصل مقاله (732.19 K) | ||
نوع مقاله: Research Paper | ||
شناسه دیجیتال (DOI): 10.22059/jac.2014.7918 | ||
نویسندگان | ||
P. Jeyanthi* 1؛ T. Saratha Devi2 | ||
1Research Centre, Department of Mathematics, Govindammal Aditanar College for Women Tiruchendur, Tamil Nadu, India. | ||
2Department of Mathematics, G. Venkataswamy Naidu College, Kovilpatti, Tamil Nadu, India. | ||
چکیده | ||
An injective map f : E(G) → {±1, ±2, · · · , ±q} is said to be an edge pair sum labeling of a graph G(p, q) if the induced vertex function f*: V (G) → Z − {0} defined by f*(v) = (Sigma e∈Ev) f (e) is one-one, where Ev denotes the set of edges in G that are incident with a vetex 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 which admits edge pair sum labeling is called an edge pair sum graph. In this paper we exhibit some spider graph. | ||
کلیدواژهها | ||
Edge pair sum labeling؛ edge pair sum graph؛ spider graph | ||
آمار تعداد مشاهده مقاله: 1,592 تعداد دریافت فایل اصل مقاله: 1,554 |