کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
8901268 | 1631734 | 2018 | 10 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Local antimagic labeling of graphs
ترجمه فارسی عنوان
برچسب زدن محلی بر روی نمودار
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
چکیده انگلیسی
A k-labeling of a graph G is an injective function Ï from E(G) to m+k real numbers, where m=|E(G)|. Let μG(v)=âuvâE(G)Ï(uv). A graph is called antimagic if G admits a 0-labeling with labels in {1,2,â¦,|E(G)|} such that μG(u)â¯â â¯Î¼G(v) for any pair u, vâ¯ââ¯V(G). A well-known conjecture of Hartsfield and Ringel states that every connected graph other than K2 admits an antimagic labeling. Recently, two sets of authors Arumugam, Premalatha, BÄca, SemanÄcová-FenÌovÌcÃková, and Bensmail, Senhaji, Lyngsie independently introduced the weaker notion of a local antimagic labeling, which only distinguishes adjacent vertices by sum with labels in {1,2,â¦,|E(G)|}. Both sets of authors conjecture that any connected graph other than K2 admits a local antimagic labeling. In this paper, we prove that every subcubic graph without isolated edges admits a local antimagic labeling with |E(G)| positive real labels. We also prove that each graph G without isolated edges admits a local antimagic k-labeling, where k=min{Î(G)+1,3col(G)+32}, and col(G) is the coloring number of G. Actually, the latter result holds for the list version.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 322, 1 April 2018, Pages 30-39
Journal: Applied Mathematics and Computation - Volume 322, 1 April 2018, Pages 30-39
نویسندگان
Xiaowei Yu, Jie Hu, Donglei Yang, Jianliang Wu, Guanghui Wang,