Computing the bipartite edge frustration of fullerene graphs
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.
bipartite edge frustration fullerene graph bipartite spanning subgraph icosahedral fullerene fullerene stability