On the diameter and some related invariants of fullerene graphs (CROSBI ID 183022)
Prilog u časopisu | izvorni znanstveni rad | međunarodna recenzija
Podaci o odgovornosti
Andova, Vesna ; Došlić, Tomislav ; Krnc, Matjaž ; Lužar, Borut ; Škrekovski, Riste
engleski
On the diameter and some related invariants of fullerene graphs
Fullerene graphs are 3-connected 3-regular planar graphs with only pentagonal and hexagonal faces. We show that the diameter of a fullerene graph G of order n is at least (√24n−15−3)/6 and at most n/5 + 1. Moreover, if G is not a (5, 0)-nanotube, its diameter is at most n/6 + 5/2. As a consequence, we improve the upper bound on the saturation number of fullerene graphs. We also report an improved lower bound on the independence number and an upper bound on the smallest eigenvalue of fullerene graphs, confirming some conjectures for large fullerene graphs.
fullerene graph; diameter; saturation number
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
Podaci o izdanju
68 (1)
2012.
109-130
objavljeno
0340-6253