کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6871373 | 1440184 | 2018 | 10 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Neighbor sum distinguishing total coloring of sparse IC-planar graphs
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
Two distinct crossings are independent if the end-vertices of the crossed edge are mutually different. If a graph G has a drawing in the plane such that every two crossings are independent, then we call G a plane graph with independent crossings or IC-planar graph for short. A proper total-k-coloring of a graph G is a mapping c:V(G)âªE(G)â{1,2,...,k} such that any two adjacent elements in V(G)âªE(G) receive different colors. Let âc(v) denote the sum of the color of a vertex v and the colors of all incident edges of v. A total-k-neighbor sum distinguishing-coloring of G is a total-k-coloring of G such that for each edge uvâE(G), âc(u)â âc(v). The least number k needed for such a coloring of G is the neighbor sum distinguishing total chromatic number, denoted by ÏΣâ²â²(G). In this paper, it is proved that ÏΣâ²â²(G)â¤max{Î(G)+3,11} if G is a triangle-free IC-planar graph, and ÏΣâ²â²(G)â¤max{Î(G)+3,15} if G is an IC-planar graph without adjacent triangles, where Î(G) is the maximum degree of G.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Applied Mathematics - Volume 239, 20 April 2018, Pages 183-192
Journal: Discrete Applied Mathematics - Volume 239, 20 April 2018, Pages 183-192
نویسندگان
Wen-yao Song, Lian-ying Miao, Jin-bo Li, Yue-ying Zhao, Jing-ru Pang,