تعداد نشریات | 158 |
تعداد شمارهها | 6,226 |
تعداد مقالات | 67,694 |
تعداد مشاهده مقاله | 115,006,153 |
تعداد دریافت فایل اصل مقاله | 89,687,423 |
Skolem Odd Difference Mean Graphs | ||
Journal of Algorithms and Computation | ||
مقاله 1، دوره 45، شماره 1، اسفند 2014، صفحه 1-12 اصل مقاله (734.16 K) | ||
نوع مقاله: Research Paper | ||
شناسه دیجیتال (DOI): 10.22059/jac.2014.7916 | ||
نویسندگان | ||
P. Jeyanthi* 1؛ D. Ramya2؛ R. Kalaiyarasi2 | ||
1Principal and Head of the Research Centre,Department of Mathematics,Govindammal Aditanar College for Women,Tiruchendur,Tamilnadu,INDIA | ||
2Department of Mathematics, Dr.Sivanthi Aditanar College of Engineering, Tiruchendur- 628 215, India. | ||
چکیده | ||
In this paper we define a new labeling called skolem odd difference mean labeling and investigate skolem odd difference meanness of some standard graphs. Let G = (V,E) be a graph with p vertices and q edges. G is said be skolem odd difference mean if there exists a function f : V (G) → {0, 1, 2, 3, . . . , p + 3q − 3} satisfying f is 1−1 and the induced map f : E(G) → {1, 3, 5, . . . , 2q−1} denoted by f*(e) =|f(u)−f(v)|/2 is a bijection. A graph that admits skolem odd difference mean labeling is called odd difference mean graph. We call skolem odd difference mean labeling as skolem even vertex odd difference mean labeling if all the vertex labels are even. | ||
کلیدواژهها | ||
mean labeling؛ skolem difference mean labeling؛ skolem odd difference mean labeling؛ skolem odd difference mean graph؛ skolem even vertex odd difference mean labeling | ||
آمار تعداد مشاهده مقاله: 1,600 تعداد دریافت فایل اصل مقاله: 1,548 |