Computing the bipartite edge frustration of fullerene graphs (Q2370428): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: GRAFFITI / rank | |||
Normal rank | |||
Revision as of 05:19, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the bipartite edge frustration of fullerene graphs |
scientific article |
Statements
Computing the bipartite edge frustration of fullerene graphs (English)
0 references
26 June 2007
0 references
bipartite edge frustration
0 references
fullerene graph
0 references
icosahedral fullerene
0 references
fullerene stability
0 references
bipartite spanning subgraph
0 references
