کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
9512409 | 1632461 | 2005 | 8 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
The transformation graph Gxyz when xyz=-++
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
The transformation graph G-++ of G is the graph with vertex set V(G)âªE(G) in which the vertex x and y are joined by an edge if one of the following conditions holds: (i) x,yâV(G), and x and y are not adjacent in G, (ii) x,yâE(G), and x and y are adjacent in G, (iii) one of x and y is in V(G) and the other is in E(G), and they are incident in G. In this paper, it is shown that for two graphs G and Gâ², G-++â
Gâ²-++ if and only if Gâ
Gâ². Simple necessary and sufficient conditions are given for G-++ to be planar and hamiltonian, respectively. It is also shown that for a graph G, the edge-connectivity of G-++ is equal to its minimum degree. Two related conjectures and some research problems are presented.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 296, Issues 2â3, 6 July 2005, Pages 263-270
Journal: Discrete Mathematics - Volume 296, Issues 2â3, 6 July 2005, Pages 263-270
نویسندگان
Baoyindureng Wu, Li Zhang, Zhao Zhang,