کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4647835 | 1342380 | 2012 | 6 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
On 2-switches and isomorphism classes
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
A 2-switch is an edge addition/deletion operation that changes adjacencies in the graph while preserving the degree of each vertex. A well-known result states that graphs with the same degree sequence may be changed into each other via sequences of 2-switches. We show that if a 2-switch changes the isomorphism class of a graph, then it must take place in one of four configurations. We also present a sufficient condition for a 2-switch to change the isomorphism class of a graph. As consequences, we give a new characterization of matrogenic graphs and determine the largest hereditary graph family whose members are all the unique realizations (up to isomorphism) of their respective degree sequences.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 312, Issue 15, 6 August 2012, Pages 2217–2222
Journal: Discrete Mathematics - Volume 312, Issue 15, 6 August 2012, Pages 2217–2222
نویسندگان
Michael D. Barrus,