کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4647922 | 1342383 | 2012 | 6 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
The crossing number of Pn2□C3
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
The exact crossing number is known only for a few specific families of graphs. Cartesian products of two graphs belong to the first families of graphs for which the crossing number has been studied. Let PnPn be a path with n+1n+1 vertices. Pnk, the kk-power of the graph PnPn, is a graph on the same vertex set as PnPn and the edges that join two vertices of PnPn if the distance between them is at most kk. Very recently, some results concerning crossing numbers of Pnk were obtained. In this paper, the crossing numbers of the Cartesian product of Pn2 with the cycle CmCm are studied. It is proved that the crossing number of the graph Pn2□C3 is 3n−33n−3, and the upper bound for the crossing number of the graph Pn2□Cm is given.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 312, Issue 14, 28 July 2012, Pages 2096–2101
Journal: Discrete Mathematics - Volume 312, Issue 14, 28 July 2012, Pages 2096–2101
نویسندگان
Marián Klešč, Daniela Kravecová,