Forcing and anti-forcing numbers of (3,6)-fullerenes

zbMATH Open1461.05171MaRDI QIDQ5280052FDOQ5280052

Authors Lingjuan Shi, Heping Zhang

Publication date 19 July 2017

zbMATH Keywords

perfect matchingforcing number

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Chemical graph theory (05C92)

Recommendations

• On the anti-forcing number of fullerene graphs
• Characterizing the fullerene graphs with the minimum forcing number 3
• Forcing matching numbers of fullerene graphs
• On forcing matching number of boron-nitrogen fullerene graphs
• Anti-forcing number of some specific graphs

Cited in

(13)

• On the maximum forcing and anti-forcing numbers of \((4, 6)\)-fullerenes
• Complete forcing numbers of \((4, 6)\)-fullerenes
• On the Clar number of graphene fragment
• Anti-forcing spectrum of any cata-condensed hexagonal system is continuous
• Forcing matching numbers of fullerene graphs
• Anti-forcing polynomials for benzenoid systems with forcing edges
• On the anti-forcing number of fullerene graphs
• Characterizing the fullerene graphs with the minimum forcing number 3
• The anti-forcing spectra of \(( 4 , 6 )\)-fullerenes
• Restricted 2-extendability of (3,6)-fullerenes
• Anti-forcing number of some specific graphs
• On forcing matching number of boron-nitrogen fullerene graphs
• On bicriticality of (3,6)-fullerene graphs

This page was built for publication: Forcing and anti-forcing numbers of (3,6)-fullerenes

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