The fullerene graphs with a perfect star packing

DOI10.26493/1855-3974.2631.be0zbMath1504.05286OpenAlexW4220947777MaRDI QIDQ5056834

Lingjuan Shi

Publication date: 8 December 2022

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.26493/1855-3974.2631.be0

zbMATH Keywords

efficient dominating setfullerene graphperfect star packing

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Chemical graph theory (05C92)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient dominating sets in circulant graphs
• Packing lines in a hypercube
• Packing in honeycomb networks
• Packing stars in fullerenes
• An upper bound for the Clar number of fullerene graphs
• Perfect codes over graphs
• On lower bounds of number of perfect matchings in fullerene graphs
• Efficient dominating sets in Cayley graphs.
• New lower bound on the number of perfect matchings in fullerene graphs
• Worst-case efficient dominating sets in digraphs
• Packing resonant hexagons in fullerenes
• Fullerenes with complete Clar structure
• The bondage numbers and efficient dominations of vertex-transitive graphs
• Perfect codes in graphs
• Polynomial-time data reduction for dominating set
• The isolated-pentagon rule and nice substructures in fullerenes
• On the anti-forcing number of fullerene graphs
• Scheduling Split Intervals
• The Number of Hexagons and the Simplicity of Geodesics on Certain Polyhedra
• Fullerenes with the maximum Clar number

This page was built for publication: The fullerene graphs with a perfect star packing