Construction of fullerenes and Pogorelov polytopes with 5-, 6- and one 7-gonal face

DOI10.3390/sym10030067zbMath1392.52006OpenAlexW2785856228WikidataQ130121920 ScholiaQ130121920MaRDI QIDQ1657010

Nikolai Erokhovets

Publication date: 13 August 2018

Published in: Symmetry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/sym10030067

zbMATH Keywords

connected sumfullerenes\(p\)-vector\(k\)-beltscyclically 5-edge connected graphright-angled polytopestruncation of edges

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Three-dimensional polytopes (52B10) Structural characterization of families of graphs (05C75) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Related Items (3)

Spectral clustering of combinatorial fullerene isomers based on their facet graph structure ⋮ Theory of families of polytopes: fullerenes and Pogorelov polytopes ⋮ Three-dimensional right-angled polytopes of finite volume in the Lobachevsky space: combinatorics and constructions

Uses Software

• FuiGui
• House of Graphs
• plantri
• Fullerene
• CaGe

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Truncations of simple polytopes and applications
• Cyclic 7-edge-cuts in fullerene graphs
• Edge reductions in cyclically \(k\)-connected cubic graphs
• A note on the cyclical edge-connectivity of fullerene graphs
• Cyclic edge-cuts in fullerene graphs
• On cyclic edge-connectivity of fullerenes
• Organizing volumes of right-angled hyperbolic polyhedra
• Numbers of faces in disordered patches
• Matching theory
• Three-dimensional hyperbolic manifolds of Löbell type
• Uniform cyclic edge connectivity in cubic graphs
• Generating the \(c^*5\)-connected graphs
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• On lower bounds of number of perfect matchings in fullerene graphs
• Cyclical edge-connectivity of fullerene graphs and \((k,6)\)-cages
• House of Graphs: a database of interesting graphs
• On generating planar graphs
• Geometric structure of chemistry-relevant graphs. Zigzags and central circuits
• Cyclically five-connected cubic graphs
• A regular partition of Lobachevskian space
• Some analogues of Eberhard's theorem on convex polytopes
• Construction of planar triangulations with minimum degree 5
• Fullerenes and disk-fullerenes
• Mathematical aspects of fullerenes
• Constructions of families of three-dimensional polytopes, characteristic patches of fullerenes, and Pogorelov polytopes
• Every Planar Map is Four Colorable
• Lectures on Polytopes
• Convex Polytopes
• Comparing the constructions of Goldberg, Fuller, Caspar, Klug and Coxeter, and a general approach to local symmetry-preserving operations
• FULLERENES, POLYTOPES AND TORIC TOPOLOGY
• Combinatorics of flag simplicial 3-polytopes
• Cohomological rigidity of manifolds defined by 3-dimensional polytopes
• Right-angled polyhedra and hyperbolic 3-manifolds
• Toric Topology
• ON CONVEX POLYHEDRA IN LOBAČEVSKIĬ SPACES
• A Generation Procedure for the Simple 3-Polytopes With Cyclically 5-Connected Graphs
• The Number of Hexagons and the Simplicity of Geodesics on Certain Polyhedra

This page was built for publication: Construction of fullerenes and Pogorelov polytopes with 5-, 6- and one 7-gonal face