| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 419525 | Discrete Applied Mathematics | 2010 | 8 Pages |
Abstract
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 GG and denoted by φ(G)φ(G). In this paper we determine the bipartite edge frustration of some classes of composite graphs.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Z. Yarahmadi, T. Došlić, A.R. Ashrafi,