A fast algorithm for computing bipartite edge frustration number of (3,6)-fullerenes

The vertex and edge bipartization problems are to find the minimum number of vertices and edges, respectively, whose removal makes the graph bipartite. It is well-known that these problems are NP hard even for cubic graph. In this paper, a result is proved by which it is possible to find a fast algorithm for computing the edge bipartization number of (3,6)-fullerenes.

[1]  S. C. O'brien,et al.  C60: Buckminsterfullerene , 1985, Nature.

[2]  D. Manolopoulos,et al.  An Atlas of Fullerenes , 1995 .

[3]  Structure of the truncated icosahedron (e.g. fullerene or C60, viral coatings) and a 60-element conjugacy class inPSl(2, 11) , 1995 .

[4]  Peter E. John,et al.  Spectra of toroidal graphs , 2009, Discret. Math..

[5]  C. S. Edwards.  Some Extremal Properties of Bipartite Subgraphs , 1973, Canadian Journal of Mathematics.

[6]  Ali Reza Ashrafi,et al.  The bipartite edge frustration of composite graphs , 2010, Discret. Appl. Math..

[7]  Zahra Yarahmadi.  The bipartite edge frustration of extension of splice and link graphs , 2010, Appl. Math. Lett..

[8]  Robert Sámal,et al.  Cayley sum graphs and eigenvalues of (3, 6)-fullerenes , 2007, J. Comb. Theory, Ser. B.

[9]  Craig E. Larson,et al.  Graph-Theoretic Independence as a Predictor of Fullerene Stability , 2003 .

[10]  Ali Reza Ashrafi,et al.  The bipartite edge frustration of graphs under subdivided edges and their related sums , 2011, Comput. Math. Appl..

[11]  Heping Zhang,et al.  Hexagonal resonance of (3,6)-fullerenes , 2011, Journal of Mathematical Chemistry.

[12]  T. Došlić.  Bipartivity of fullerene graphs and fullerene stability , 2005 .

[13]  Ali Reza Ashrafi,et al.  Extremal properties of the bipartite vertex frustration of graphs , 2011, Appl. Math. Lett..

[14]  B. Kostant.  Structure of the truncated icosahedron (such as fullerene or viral coatings) and a 60-element conjugacy class in PSl(2, 11). , 1994, Proceedings of the National Academy of Sciences of the United States of America.

[16]  Tomislav Doslic,et al.  Computing the bipartite edge frustration of fullerene graphs , 2007, Discret. Appl. Math..

[17]  Hyeong-Ah Choi,et al.  Graph Bipartization and via Minimization , 1989, SIAM J. Discret. Math..

[18]  Z. Yarahmadi,et al.  Study of Fullerenes by Some New Topological Index , 2013 .

[19]  Patrick W. Fowler,et al.  Independence number and fullerene stability , 2007 .