Computing the bipartite edge frustration of fullerene graphs

DOI10.1016/j.dam.2006.12.003zbMath1118.05092OpenAlexW2074908910MaRDI QIDQ2370428

Tomislav Došlić, Damir Vukičević

Publication date: 26 June 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2006.12.003

zbMATH Keywords

bipartite edge frustrationfullerene graphicosahedral fullerenefullerene stabilitybipartite spanning subgraph

Mathematics Subject Classification ID

Applications of graph theory (05C90) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Related Items (24)

The bipartite edge frustration of hierarchical product of graphs ⋮ Nice pairs of odd cycles in fullerene graphs ⋮ Graphs with maximum Laplacian and signless Laplacian Estrada index ⋮ On the critical difference of almost bipartite graphs ⋮ Critical graphs for the chromatic edge-stability number ⋮ The Restricted Edge-Connectivity of Kronecker Product Graphs ⋮ The bipartite edge frustration of composite graphs ⋮ Use of the Szeged index and the revised Szeged index for measuring network bipartivity ⋮ A characterization of the edge connectivity of direct products of graphs ⋮ A modeling and computational study of the frustration index in signed networks ⋮ On edge connectivity of direct products of graphs ⋮ On critical graphs for the chromatic edge-stability number ⋮ Bipartizing fullerenes ⋮ Geometrical and Topological Dimensions of the Diamond ⋮ Study of the Bipartite Edge Frustration of Graphs ⋮ The bipartite edge frustration of graphs under subdivided edges and their related sums ⋮ On the anti-Kekulé number and odd cycle transversal of regular graphs ⋮ Extremal properties of the bipartite vertex frustration of graphs ⋮ On bicriticality of (3,6)-fullerene graphs ⋮ On the bipartite vertex frustration of graphs ⋮ On the chromatic edge stability number of graphs ⋮ Nordhaus-Gaddum and other bounds for the chromatic edge-stability number ⋮ The bipartite edge frustration of extension of splice and link graphs ⋮ Bounds for the extremal eigenvalues of gain Laplacian matrices

Uses Software

• GRAFFITI

Cites Work

• On conjectures of Graffiti
• Parallel concepts in graph theory
• On some structural properties of fullerene graphs
• The independence numbers of fullerenes and benzenoids
• The Number of Hexagons and the Simplicity of Geodesics on Certain Polyhedra
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing the bipartite edge frustration of fullerene graphs