Computing the bipartite edge frustration of fullerene graphs

Authors:
Tomislav Došlić;Damir Vukičević
Affiliations:
Department of Informatics and Mathematics, Faculty of Agriculture, University of Zagreb, Svetošimunska c. 25, 10000 Zagreb, Croatia;Department of Mathematics, University of Split, N. Tesle 12, 21000 Split, Croatia
Venue:
Discrete Applied Mathematics
Year:
2007

Citing 5
Cited 5

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
On conjectures of graffiti

Discrete Mathematics - First Japan Conference on Graph Theory and Applications
A constructive enumeration of fullerenes

Journal of Algorithms
Data structures for weighted matching and nearest common ancestors with linking

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
The independence numbers of fullerenes and benzenoids

European Journal of Combinatorics

The bipartite edge frustration of composite graphs

Discrete Applied Mathematics
Use of the Szeged index and the revised Szeged index for measuring network bipartivity

Discrete Applied Mathematics
On edge connectivity of direct products of graphs

Information Processing Letters
Bipartizing fullerenes

European Journal of Combinatorics
On the anti-Kekulé number and odd cycle transversal of regular graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.04

Visualization

Abstract

Bipartite edge frustration of a graph is defined as the smallest number of edges that have to be deleted from the graph to obtain a bipartite spanning subgraph. We show that for fullerene graphs this quantity can be computed in polynomial time and obtain explicit formulas for the icosahedral fullerenes. We also report some computational results and discuss a potential application of this invariant in the context of fullerene stability.