The bipartite edge frustration of composite graphs

  • Authors:

  • Z. Yarahmadi;T. Došlić;A. R. Ashrafi

  • Affiliations:

  • Department of Mathematics, Faculty of Science, University of Kashan, Kashan 87317-51167, Islamic Republic of Iran;Faculty of Civil Engineering, University of Zagreb, Kačićeva 26, 10000 Zagreb, Croatia;Department of Mathematics, Faculty of Science, University of Kashan, Kashan 87317-51167, Islamic Republic of Iran and School of Mathematics, Institute for Research in Fundamental Sciences (IPM), P ...

  • Venue:
  • Discrete Applied Mathematics
  • Year:
  • 2010

Quantified Score

Hi-index 0.04

Visualization

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 @f(G). In this paper we determine the bipartite edge frustration of some classes of composite graphs.