|
|||||
|
|
Computing the bipartite edge frustration of fullerene graphs |
|
| Authors: | Tomislav Došli? |
| Institution: | a Department of Informatics and Mathematics, Faculty of Agriculture, University of Zagreb, Svetošimunska c. 25, 10000 Zagreb, Croatia b Department of Mathematics, University of Split, N. Tesle 12, 21000 Split, Croatia |
| Abstract: | Bipartite edge frustration of a graph is defined as the smallest number of edges that have to be deleted from the graph to obtain a bipartite spanning subgraph. We show that for fullerene graphs this quantity can be computed in polynomial time and obtain explicit formulas for the icosahedral fullerenes. We also report some computational results and discuss a potential application of this invariant in the context of fullerene stability. |
| Keywords: | Bipartite edge frustration Fullerene graph Icosahedral fullerene Fullerene stability Bipartite spanning subgraph |
| 本文献已被 ScienceDirect 等数据库收录！ | |