شماره ركورد كنفرانس
1771
عنوان مقاله
Some Infinite Classes of Fullerene Graphs
پديدآورندگان
Zaare-Nahandi Rashid نويسنده Institute for Advanced Studies in Basic Sciences
تعداد صفحه
4
كليدواژه
Fullerene , leapfrogging process , cubic planer graph
عنوان كنفرانس
The First Conference and Workshop on Mathematical Chemistry
زبان مدرك
فارسی
چكيده فارسي
A fullerene graph is a 3 regular planar simple finite graph with pentagon or hexagon faces. In these
graphs the number of pentagon faces is 12. Therefore, any fullerene graph can be characterized by
number of its hexagon faces. In this note, for any h> 1, we will construct a fullerene graph with h
hexagon faces. Then, using the leapfrogging process we will construct stablefullerenes with20+3h
hexagon faces, for any h> 1
شماره مدرك كنفرانس
1758929
سال انتشار
2008
از صفحه
1
تا صفحه
4
سال انتشار
0
لينک به اين مدرک