Constructing fullerene graphs from their eigenvalues and angles (Q1855386)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constructing fullerene graphs from their eigenvalues and angles |
scientific article |
Statements
Constructing fullerene graphs from their eigenvalues and angles (English)
0 references
5 February 2003
0 references
An algorithm for constructing all fullerene graphs with specified eigenvalues and angles is given. Also, an enumeration of shortest paths and closed walks in hexagonal nets is established.
0 references
adjacency matrix
0 references
enumeration
0 references
hexagonal nets
0 references
