Computing the bipartite edge frustration of fullerene graphs
Authors:
- Tomislav DošlićTDTomislav Došlić
- Damir VukičevićDVDamir Vukičević
- 1 May 2007
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 155 (10) , 1294-1301
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- The independence numbers of fullerenes and benzenoidsEuropean Journal of Combinatorics, 2006
- Spectral measures of bipartivity in complex networksPhysical Review E, 2005
- Bipartivity of fullerene graphs and fullerene stabilityChemical Physics Letters, 2005
- Network bipartivityPhysical Review E, 2003
- Graph-theoretic independence as a predictor of fullerene stabilityChemical Physics Letters, 2003
- On Some Structural Properties of Fullerene GraphsJournal of Mathematical Chemistry, 2002
- Pentagon adjacency as a determinant of fullerene stabilityPhysical Chemistry Chemical Physics, 1999
- A Constructive Enumeration of FullerenesJournal of Algorithms, 1997
- Systematics of bonding in non-icosahedral carbon clustersTheoretical Chemistry Accounts, 1988
- The Number of Hexagons and the Simplicity of Geodesics on Certain PolyhedraCanadian Journal of Mathematics, 1963