The Bipartite Vertex Frustration of Some Infinite Families of Fullerenes

Let G = (V, E) be a simple graph. The bipartite vertex frustration of G, denoted by ψ(G), is the smallest number of vertices that have to be deleted from a graph to obtain a bipartite subgraph. It is easy to see that ψ(G) is a topological index and G is bipartite if and only if ψ(G) = 0. Thus ψ(G) is a measure of bipartivity . In this paper, we compute the bipartite vertex frustration of some infinite families of fullerene graphs.