this paper is dedicated to propose an algorithm in order to generate the certain isomers of some well-known fullerene bases. furthermore, we enlist the bipartite edge frustration correlated with some of symmetrically distinct innite families of fullerenes generated by the oered process.

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. © 2010 Elsevier B.V. All rights reserved.

This paper is dedicated to propose an algorithm in order to generate the certain isomers of some well-known fullerene bases. Furthermore, we enlist the bipartite edge frustration correlated with some of symmetrically distinct innite families of fullerenes generated by the oered process.

A signed graph is a graph where each edge is labeled as either positive or negative. A circle is positive if the product of edge labels is positive. The frustration index is the least number of edges that need to be removed so that every remaining circle is positive. The maximum frustration of a graph is the maximum frustration index over all possible sign labellings. We prove two results about...

The smallest number of edges that have to be deleted from a graph G to obtain a bipartite spanning subgraph is called the bipartite edge frustration of G and denoted by φ(G). In this paper our recent results on computing this quantity for hierarchical product of graphs are reported. We also present a fast algorithm for computing edge frustration index of (3, 6)−fullerene graphs.

The bipartite vertex (resp. edge) frustration of a graph G, denoted by ψ(G) (resp. φ(G)), is the smallest number of vertices (resp. edges) that have to be deleted from G to obtain a bipartite subgraph of G. A sharp lower bound of the bipartite vertex frustration of the line graph L(G) of every graph G is given. In addition, the exact value of ψ(L(G)) is calculated when G is a forest.

In a nanographene ring with zigzag edges, the spin-polarized state and the charge-polarized state are stabilized by the on-site and the nearest neighbor Coulomb repulsions, U and V , respectively, within the extended Hubbard model under the mean field approximation. In a Möbius strip of the nanographene with a zigzag edge, U stabilizes two magnetic states, the domain wall state and the helical ...