|
|
|
|
finding fullerene graphs in group-graphs
|
|
|
|
|
|
|
|
نویسنده
|
mirzargar mahsa
|
|
منبع
|
كنفرانس نظريه گراف و تركيبيات جبري - 2020 - دوره : 11 - یازدهمین کنفرانس بین المللی نظریه گراف و ترکیبیات جبری ایران - کد همایش: 9919164009 - صفحه:88 -90
|
|
چکیده
|
A fullerene f is a 3−connected cubic planar graph with entirely 12 pentagonal faces and n=2 − 10hexagonal faces where n is the number of vertices of f. it is proved that among the fullerenes graphsonly f60 is the cayley graph. therefore, it is important to investigate this problem for new graph groups.the aim of this paper is to find the structure of fullerenes in some graphs defined by groups.
|
|
کلیدواژه
|
cayley graph ,fullerene ,power graph ,commuting graph
|
|
آدرس
|
mahallat institute of higher education, mahallat institute of higher education, faculty of science, iran
|
|
پست الکترونیکی
|
m.mirzargar@gmail.com
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|