Constructing fullerene graphs from their eigenvalues and angles

DOI10.1016/S0024-3795(02)00280-XzbMath1017.05070OpenAlexW2099817611MaRDI QIDQ1855386

Dragan Stevanović, Peter Rowlinson, Dragos Cvetković, Patrick W. Fowler

Publication date: 5 February 2003

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0024-3795(02)00280-x

zbMATH Keywords

enumerationadjacency matrixhexagonal nets

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (5)

ON THE SPECTRUM OF DERANGEMENT GRAPHS OF ORDER A PRODUCT OF THREE PRIMES ⋮ Remarks on characteristic coefficients of fullerene graphs ⋮ Polyhedral graphs via their automorphism groups ⋮ On the automorphism group of polyhedral graphs ⋮ On cyclic edge-connectivity of fullerenes

Uses Software

• OEIS

Cites Work

• Constructing trees with given eigenvalues and angles
• On the enumeration of rectangular (0, 1)-matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Constructing fullerene graphs from their eigenvalues and angles