دانلود رایگان مقاله برچسب گذاری گراف با تعیین وزن

عنوان فارسی
برچسب گذاری گراف با تعیین وزن
عنوان انگلیسی
On total labelings of graphs with prescribed weights
صفحات مقاله فارسی
0
صفحات مقاله انگلیسی
9
سال انتشار
2016
نشریه
الزویر - Elsevier
فرمت مقاله انگلیسی
PDF
کد محصول
E2083
رشته های مرتبط با این مقاله
ریاضی
گرایش های مرتبط با این مقاله
ریاضی کاربردی، آنالیز عددی
مجله
مجله بین المللی نمودار ها و ترکیبیات - International Journal of Graphs and Combinatorics
دانشگاه
دانشکده علوم ریاضی، دانشگاه GC، لاهور، پاکستان
کلمات کلیدی
برچسب زدن کل.راس فوق العاده، مجموع برچسب زدن
۰.۰ (بدون امتیاز)
امتیاز دهید
چکیده

Abstract


Let G = (V, E) be a finite, simple and undirected graph. The edge-magic total or vertex-magic total labeling of G is a bijection f from V(G) ∪ E(G) onto the set of consecutive integers {1, 2, . . . , |V(G)| + |E(G)|}, such that all the edge weights or vertex weights are equal to a constant, respectively. When all the edge weights or vertex weights are different then the labeling is called edge-antimagic or vertex-antimagic total, respectively. In this paper we provide some classes of graphs that are simultaneously super edge-magic total and super vertex-antimagic total, that is, graphs admitting labeling that has both properties at the same time. We show several results for fans, sun graphs, caterpillars and prisms.

نتیجه گیری

3. Conclusion


In the paper we dealt with the problem of finding total labelings of some classes of graphs that are simultaneously super vertex-magic and super edge-antimagic. We showed the existence of such labelings for certain classes of graphs, namely fans, sun graphs, one class of caterpillars and prisms. In [12] authors ask not only for finding classes of graphs that are simultaneously vertex-magic and edge-antimagic but also graphs that are simultaneously vertex-antimagic and edge-magic.


بدون دیدگاه