کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4650837 | 1342504 | 2007 | 11 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
(d,1)(d,1)-total labelling of planar graphs with large girth and high maximum degree
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
The (d,1)(d,1)-total number λdT(G) of a graph G is the width of the smallest range of integers that suffices to label the vertices and the edges of G such that no two adjacent vertices have the same label, no two incident edges have the same label and the difference between the labels of a vertex and its incident edges is at least d . This notion was introduced in [F. Havet, (d,1)(d,1)-total labelling of graphs, in: Workshop on Graphs and Algorithms, Dijon, France, 2003]. In this paper, we prove that λdT(G)⩽Δ+2d-2 for planar graphs with large girth and high maximum degree ΔΔ. Our results are optimal for d=2d=2.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 307, Issue 16, 28 July 2007, Pages 2141–2151
Journal: Discrete Mathematics - Volume 307, Issue 16, 28 July 2007, Pages 2141–2151
نویسندگان
Fabrice Bazzaro, Mickaël Montassier, André Raspaud,