The bipartite edge frustration of extension of splice and link graphs

The smallest number of edges that have to be deleted from a graph GG to obtain a bipartite spanning subgraph is called the bipartite edge frustration of GG and denoted by φ(G)φ(G). In this paper we extend the splice and link for two graphs and determine their bipartite edge frustration. As an application, the bipartite edge frustration of a polybuckyball is computed.