Article ID Journal Published Year Pages File Type
1708414 Applied Mathematics Letters 2011 4 Pages PDF
Abstract

The smallest number of vertices that have to be deleted from a graph GG to obtain a bipartite subgraph is called the bipartite vertex frustration of GG and denoted by ψ(G)ψ(G). In this paper, some extremal properties of this graph invariant are presented. Moreover, we present an exact formula for the bipartite vertex frustration of the corona product of graphs.

Keywords
Related Topics
Physical Sciences and Engineering Engineering Computational Mechanics
Preview
Extremal properties of the bipartite vertex frustration of graphs
Authors
, ,