|
|||||
|
|
The bipartite edge frustration of composite graphs |
|
| Authors: | Z Yarahmadi AR Ashrafi |
| Institution: | a Department of Mathematics, Faculty of Science, University of Kashan, Kashan 87317-51167, Islamic Republic of Iran b Faculty of Civil Engineering, University of Zagreb, Ka?i?eva 26, 10000 Zagreb, Croatia c School of Mathematics, Institute for Research in Fundamental Sciences (IPM), P.O. Box: 19395-5746, Tehran, Islamic Republic of Iran |
| 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 G and denoted by φ(G). In this paper we determine the bipartite edge frustration of some classes of composite graphs. |
| Keywords: | Bipartite graph Bipartite edge frustration Composite graph |
| 本文献已被 ScienceDirect 等数据库收录！ | |