A mathematical programming model for computing the fries number of a fullerene

DOI10.1016/j.apm.2015.01.005zbMath1443.92030OpenAlexW2023695140MaRDI QIDQ2282646

Yanyan Li

Publication date: 8 January 2020

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2015.01.005

zbMATH Keywords

fullerenesperfect matchingquadratic programming problembinary integer linear programmingfries number

Mathematics Subject Classification ID

Mathematical modeling or simulation for problems pertaining to biology (92-10) Chemical graph theory (05C92)

Related Items

Clar structures vs Fries structures in hexagonal systems

Cites Work

• Unnamed Item
• Unnamed Item
• A polynomial arc-search interior-point algorithm for convex quadratic programming
• Interior point methods 25 years later
• Fullerene graphs have exponentially many perfect matchings
• Kekulé structures and the face independence number of a fullerene
• A complete characterization for \(k\)-resonant Klein-bottle polyhexes
• Extremal fullerene graphs with the maximum Clar number
• Forcing matching numbers of fullerene graphs
• Maximum cardinality resonant sets and maximal alternating sets of hexagonal systems
• Fullerene graphs with exponentially many perfect matchings
• On some structural properties of fullerene graphs
• A linear-programming approach to the generalized Randić index
• A quadratic programming approach to the Randić index
• Unicyclic graphs possessing Kekulé structures with minimal energy
• An interior algorithm for nonlinear optimization that combines line search and trust region steps
• The independence numbers of fullerenes and benzenoids
• Barrier Functions in Interior Point Methods
• An Interior Point Algorithm for Large-Scale Nonlinear Programming
• The Number of Hexagons and the Simplicity of Geodesics on Certain Polyhedra
• A trust region method based on interior point techniques for nonlinear programming.