scholarly journals Extremal fullerene graphs with the maximum Clar number

2009 ◽  
Vol 157 (14) ◽  
pp. 3152-3173 ◽  
Author(s):  
Dong Ye ◽  
Heping Zhang
Keyword(s):  
Clar Number ◽  
Fullerene Graphs

An Upper Bound for the Clar Number of Fullerene Graphs

2006 ◽  
Vol 41 (2) ◽  
pp. 123-133 ◽  
Author(s):  
Heping Zhang ◽  
Dong Ye
Keyword(s):  
Upper Bound ◽  
Clar Number ◽  
Fullerene Graphs

On the Clar number of graphene fragment

2021 ◽  
Vol 59 (2) ◽  
pp. 542-553
Author(s):  
Ye Tian ◽  
Biao Zhao
Keyword(s):  
Clar Number

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 Fullerenes with the maximum Clar number

2016 ◽  
Vol 202 ◽  
pp. 58-69 ◽  
Author(s):  
Yang Gao ◽  
Qiuli Li ◽  
Heping Zhang
Keyword(s):  
Clar Number

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
Sign in / Sign up

Export Citation Format

Share Document