A Simple Canonical Code for Fullerene Graphs

2009 ◽  
Vol E92-A (12) ◽  
pp. 3398-3400
Author(s):  
Naoki SHIMOTSUMA ◽  
Shin-ichi NAKANO
Keyword(s):  
Canonical Code ◽  
Fullerene Graphs

Distance-restricted matching extendability of fullerene graphs

2017 ◽  
Vol 56 (2) ◽  
pp. 606-617
Author(s):  
Michitaka Furuya ◽  
Masanori Takatou ◽  
Shoichi Tsuchiya
Keyword(s):  
Matching Extendability ◽  
Fullerene Graphs

scholarly journals Computing the bipartite edge frustration of fullerene graphs

2007 ◽  
Vol 155 (10) ◽  
pp. 1294-1301 ◽  
Author(s):  
Tomislav Došlić ◽  
Damir Vukičević
Keyword(s):  
Fullerene Graphs

scholarly journals Some Bounds for the Kirchhoff Index of Graphs

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Yujun Yang
Keyword(s):  
Connected Graph ◽  
Planar Graphs ◽  
Independence Number ◽  
Clique Number ◽  
Upper Bounds ◽  
Electrical Network ◽  
Lower And Upper Bounds ◽  
Kirchhoff Index ◽  
Resistance Distance ◽  
Fullerene Graphs

The resistance distance between two vertices of a connected graphGis defined as the effective resistance between them in the corresponding electrical network constructed fromGby replacing each edge ofGwith a unit resistor. The Kirchhoff index ofGis the sum of resistance distances between all pairs of vertices. In this paper, general bounds for the Kirchhoff index are given via the independence number and the clique number, respectively. Moreover, lower and upper bounds for the Kirchhoff index of planar graphs and fullerene graphs are investigated.

scholarly journals Cyclic edge-cuts in fullerene graphs

2007 ◽  
Vol 44 (1) ◽  
pp. 121-132 ◽  
Author(s):  
František Kardoš ◽  
Riste Škrekovski
Keyword(s):  
Fullerene Graphs

Automorphism Group and Fixing Number of (3,6)– and (4, 6)–Fullerene Graphs

2014 ◽  
Vol 45 ◽  
pp. 113-120 ◽  
Author(s):  
F. Koorepazan-Moftakhar ◽  
A.R. Ashrafi ◽  
Z. Mehranian ◽  
M. Ghorbani
Keyword(s):  
Automorphism Group ◽  
Fullerene Graphs

scholarly journals On k-Resonant Fullerene Graphs

2009 ◽  
Vol 23 (2) ◽  
pp. 1023-1044 ◽  
Author(s):  
Dong Ye ◽  
Zhongbin Qi ◽  
Heping Zhang
Keyword(s):  
Fullerene Graphs

A note on the cyclical edge-connectivity of fullerene graphs

2007 ◽  
Vol 43 (1) ◽  
pp. 134-140 ◽  
Author(s):  
Zhongbin Qi ◽  
Heping Zhang
Keyword(s):  
Edge Connectivity ◽  
Fullerene Graphs

scholarly journals On the Wiener Complexity and the Wiener Index of Fullerene Graphs

Mathematics ◽  
2019 ◽  
Vol 7 (11) ◽  
pp. 1071 ◽  
Author(s):  
Andrey A. Dobrynin ◽  
Andrei Yu Vesnin
Keyword(s):  
Mathematical Models ◽  
Wiener Index ◽  
The Other ◽  
Graph Invariant ◽  
Calculation Results ◽  
Local Graph ◽  
Sum Of Distances ◽  
Fullerene Graphs

Fullerenes are molecules that can be presented in the form of cage-like polyhedra, consisting only of carbon atoms. Fullerene graphs are mathematical models of fullerene molecules. The transmission of a vertex v of a graph is a local graph invariant defined as the sum of distances from v to all the other vertices. The number of different vertex transmissions is called the Wiener complexity of a graph. Some calculation results on the Wiener complexity and the Wiener index of fullerene graphs of order n ≤ 232 and IPR fullerene graphs of order n ≤ 270 are presented. The structure of graphs with the maximal Wiener complexity or the maximal Wiener index is discussed, and formulas for the Wiener index of several families of graphs are obtained.

Sign in / Sign up

Export Citation Format

Share Document