Forcing matching numbers of fullerene graphs

DOI10.1016/J.DAM.2009.10.013MaRDI QIDQ968177zbMATH OpenOpenAlexFDO

Authors B. E. Eshmatov

Publication date 5 May 2010

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

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

zbMATH Keywords

perfect matchingforcing numberdegree of freedomfullerene graph

Mathematics Subject Classification ID

Applications of graph theory (05C90) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Recommendations

• Characterizing the fullerene graphs with the minimum forcing number 3
• Forcing and anti-forcing numbers of (3,6)-fullerenes
• Complete forcing numbers of graphs
• On forcing matching number of boron-nitrogen fullerene graphs
• On the anti-forcing number of fullerene graphs

Cites work

• scientific article; zbMATH DE number 3150487 (Why is no real title available?)
• scientific article; zbMATH DE number 3261280 (Why is no real title available?)
• scientific article; zbMATH DE number 3369404 (Why is no real title available?)
• A note on the cyclical edge-connectivity of fullerene graphs
• Bounds on the forcing numbers of bipartite graphs
• Cyclical edge-connectivity of fullerene graphs and \((k,6)\)-cages
• Forcing bonds of a benzenoid system
• Forcing matchings on square grids
• Forcing numbers of stop signs.
• Graph theory
• Hexagonal systems with forcing edges
• Hexagonal systems with forcing single edges
• New lower bound on the number of perfect matchings in fullerene graphs
• On cyclic edge-connectivity of fullerenes
• On the forced matching numbers of bipartite graphs
• On the spectrum of the forced matching number of graphs
• Plane elementary bipartite graphs
• The Number of Hexagons and the Simplicity of Geodesics on Certain Polyhedra
• The forcing number of toroidal polyhexes
• The minimum forcing number for the torus and hypercube

Cited in

(30)

• The forcing edge covering number of a graph
• scientific article; zbMATH DE number 6282162 (Why is no real title available?)
• Fullerene graphs with exponentially many perfect matchings
• Anti-forcing number of some specific graphs
• The maximum forcing number of cylindrical grid, toroidal 4-8 lattice and Klein bottle 4-8 lattice
• Anti-forcing spectrum of any cata-condensed hexagonal system is continuous
• On the anti-Kekulé problem of cubic graphs
• On forcing matching number of boron-nitrogen fullerene graphs
• Forcing and anti-forcing numbers of (3,6)-fullerenes
• Continuous forcing spectra of even polygonal chains
• On lower bounds of number of perfect matchings in fullerene graphs
• A mathematical programming model for computing the fries number of a fullerene
• Forcing numbers of stop signs.
• Complete forcing numbers of \((4, 6)\)-fullerenes
• Uniquely forced perfect matching and unique 3-edge-coloring
• Complete forcing numbers of primitive coronoids
• Characterizing the fullerene graphs with the minimum forcing number 3
• Forcing and anti-forcing edges in bipartite graphs
• Fullerenes with the maximum Clar number
• scientific article; zbMATH DE number 6274836 (Why is no real title available?)
• Distance-restricted matching extendability of fullerene graphs
• Complete forcing numbers of catacondensed hexagonal systems
• Asymptotic enumeration of perfect matchings in \(m\)-barrel fullerene graphs
• Forcing and anti-forcing polynomials of a type of polyomino graphs
• Single coronoid systems with an anti-forcing edge
• Anti-forcing spectra of perfect matchings of graphs
• Extremal anti-forcing numbers of perfect matchings of graphs
• Anti-forcing numbers of perfect matchings of graphs
• On the maximum forcing and anti-forcing numbers of \((4, 6)\)-fullerenes
• Maximizing the minimum and maximum forcing numbers of perfect matchings of graphs

This page was built for publication: Forcing matching numbers of fullerene graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968177)