کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
8902762 | 1632243 | 2018 | 7 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
On edge-graceful labeling and deficiency for regular graphs
ترجمه فارسی عنوان
در لبه چسبندگی و کمبود برای نمودار های منظم
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
چکیده انگلیسی
An edge-graceful labeling of a finite simple graph with p vertices and q edges is a bijection from the set of edges to the set of integers {1,2,â¦,q} such that the vertex sums are pairwise distinct modulo p, where the vertex sum at a vertex is the sum of labels of all edges incident to such vertex. A graph is called edge-graceful if it admits an edge-graceful labeling. In 2005 Hefetz (2005) proved that a regular graph of even degree is edge-graceful if it contains a 2-factor consisting of mCn, where m,n are odd. In this article, we show that a regular graph of odd degree is edge-graceful if it contains either of two particular 3-factors, namely, a claw factor and a quasi-prism factor. We also introduce a new notion called edge-graceful deficiency, which is a parameter to measure how close a graph is away from being an edge-graceful graph. In particular the edge-graceful deficiency of a regular graph of even degree containing a Hamiltonian cycle is completely determined.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: AKCE International Journal of Graphs and Combinatorics - Volume 15, Issue 1, April 2018, Pages 105-111
Journal: AKCE International Journal of Graphs and Combinatorics - Volume 15, Issue 1, April 2018, Pages 105-111
نویسندگان
Tao-Ming Wang, Guang-Hui Zhang,