The bipartite edge frustration of hierarchical product of graphs

The smallest number of edges that have to be deleted from a graph G to obtain a bipartite spanning subgraph is called the bipartite edge frustration of G and denoted by ϕ(G). In this paper our recent results on computing this quantity for hierarchical product of graphs are reported. We also present a fast algorithm for computing edge frustration index of (3, 6)–fullerene graphs.