\input zb-basic
\input zb-ioport
\iteman{io-port 05992257}
\itemau{Yarahmadi, Zahra; Ashrafi, Ali Reza}
\itemti{Extremal properties of the bipartite vertex frustration of graphs.}
\itemso{Appl. Math. Lett. 24, No. 11, 1774-1777 (2011).}
\itemab
Summary: The smallest number of vertices that have to be deleted from a graph $G$ to obtain a bipartite subgraph is called the bipartite vertex frustration of $G$ and denoted by $\psi (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.
\itemrv{~}
\itemcc{}
\itemut{bipartite vertex frustration; extremal graph; bipartite graph}
\itemli{doi:10.1016/j.aml.2011.04.022}
\end