The smallest number of edges that have to be deleted from a graph to obtain a bipartite spanning subgraph is called the bipartite edge frustration of G and denoted by φ (G). In this paper we determine the bipartite edge frustration of some classes of composite graphs.
展开▼
