پیوندهای مفید
اخبار و اعلانات
آمار
| تعداد نشریات | 158 |
| تعداد شماره‌ها | 6,246 |
| تعداد مقالات | 67,922 |
| تعداد مشاهده مقاله | 115,707,239 |
| تعداد دریافت فایل اصل مقاله | 90,473,316 |
Further results on odd mean labeling of some subdivision graphs | ||
| Journal of Algorithms and Computation | ||
| مقاله 6، دوره 48، شماره 1، اسفند 2016، صفحه 81-98 اصل مقاله (283.09 K) | ||
| نوع مقاله: Research Paper | ||
| شناسه دیجیتال (DOI): 10.22059/jac.2016.7942 | ||
| نویسندگان | ||
| R. Vasuki* ؛ S. Suganthi؛ G. Pooranam | ||
| Department of Mathematics, Dr. Sivanthi Aditanar College of Engineering, Tiruchendur-628 215, Tamil Nadu, India | ||
| چکیده | ||
| Let G(V,E) be a graph with p vertices and q edges. A graph G is said to have an odd mean labeling if there exists a function f : V (G) → {0, 1, 2,...,2q - 1} satisfying f is 1 - 1 and the induced map f* : E(G) → {1, 3, 5,...,2q - 1} defi ned by f*(uv) = (f(u) + f(v))/2 if f(u) + f(v) is even f*(uv) = (f(u) + f(v) + 1)/2 if f(u) + f(v) is odd is a bijection. A graph that admits an odd mean labeling is called an odd mean graph. In this paper, we have studied an odd meanness property of the subdivision of the slanting ladder SLn for all n ≥ 2; Cn Θ K1 for n ≥ 3; the grid Pm × Pn for m, n ≥ 2; Cm@Cn for m, n ≥ 3 and P2m Θ nK1 for all m, n ≥ 1.. | ||
| کلیدواژه‌ها | ||
| labeling؛ odd mean labeling؛ odd mean graph | ||
|
آمار تعداد مشاهده مقاله: 1,639 تعداد دریافت فایل اصل مقاله: 851 |
||