کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6424050 | 1632767 | 2016 | 7 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A complete characterization of graphic sequences with a Z3-connected realization
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
A non-increasing sequence Ï=(d1,d2,â¦,dn) of non-negative integers is said to be graphic if it is the degree sequence of a simple graph G on n vertices. We say that G is a realization of Ï (or Ï is realizable by G). Let Z3 be a cyclic group of order three. If Ï has a realization G which is Z3-connected, then Ï has a Z3-connected realization G. Yang et al. (2014) proposed the following problem: Characterize all graphic sequences Ï realizable by a Z3-connected graph. In this paper, we solve this problem completely and present a complete characterization of graphic sequences with a Z3-connected realization.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Combinatorics - Volume 51, January 2016, Pages 215-221
Journal: European Journal of Combinatorics - Volume 51, January 2016, Pages 215-221
نویسندگان
Xiang-Yu Dai, Jian-Hua Yin,