کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4649241 | 1342447 | 2010 | 15 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Light graphs in families of polyhedral graphs with prescribed minimum degree, face size, edge and dual edge weight
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Light graphs in families of polyhedral graphs with prescribed minimum degree, face size, edge and dual edge weight Light graphs in families of polyhedral graphs with prescribed minimum degree, face size, edge and dual edge weight](/preview/png/4649241.png)
چکیده انگلیسی
A graph HH is defined to be light in a family HH of graphs if there exists a finite number φ(H,H)φ(H,H) such that each G∈HG∈H which contains HH as a subgraph, contains also a subgraph K≅HK≅H such that the ΔG(K)≤φ(H,H)ΔG(K)≤φ(H,H). We study light graphs in families of polyhedral graphs with prescribed minimum vertex degree δδ, minimum face degree ρρ, minimum edge weight ww and dual edge weight w∗w∗. For those families, we show that there exists a variety of small light cycles; on the other hand, we also present particular constructions showing that, for certain families, the spectrum of short cycles contains irregularly scattered cycles that are not light.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 310, Issue 12, 28 June 2010, Pages 1661–1675
Journal: Discrete Mathematics - Volume 310, Issue 12, 28 June 2010, Pages 1661–1675
نویسندگان
Barbora Ferencová, Tomáš Madaras,