The anti-forcing spectra of \(( 4 , 6 )\)-fullerenes

DOI10.1016/j.amc.2022.127090OpenAlexW4220975350MaRDI QIDQ2139808

Lifang Zhao, Heping Zhang, Lingjuan Shi

Publication date: 19 May 2022

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2022.127090

zbMATH Keywords

anti-forcing numberanti-forcing spectrum\(( 4 , 6 )\)-fullerene graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Chemical graph theory (05C92)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Anti-forcing spectra of perfect matchings of graphs
• Extremal anti-forcing numbers of perfect matchings of graphs
• The number of perfect matchings in a hypercube
• On forcing matching number of boron-nitrogen fullerene graphs
• Hexagonal systems with forcing single edges
• On the anti-Kekulé number and anti-forcing number of cata-condensed benzenoids
• Anti-forcing spectrum of any cata-condensed hexagonal system is continuous
• Forcing polynomials of benzenoid parallelogram and its related benzenoids
• Anti-forcing polynomials for benzenoid systems with forcing edges
• Continuous forcing spectra of even polygonal chains
• On the maximum forcing and anti-forcing numbers of \((4, 6)\)-fullerenes
• On the anti-forcing number of benzenoids
• Global forcing number of benzenoid graphs
• A Minimax Theorem for Directed Graphs
• Tight upper bound on the maximum anti-forcing numbers of graphs
• On the spectrum of the forced matching number of graphs
• Forcing and anti-forcing polynomials of perfect matchings of a pyrene system
• Anti-forcing numbers of perfect matchings of graphs

This page was built for publication: The anti-forcing spectra of \(( 4 , 6 )\)-fullerenes