On the maximum forcing and anti-forcing numbers of \((4, 6)\)-fullerenes

DOI10.1016/j.dam.2017.07.009zbMath1372.05223OpenAlexW2740508351MaRDI QIDQ2410263

Heping Zhang, Lingjuan Shi, Hongwei Wang

Publication date: 17 October 2017

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

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

zbMATH Keywords

perfect matchinganti-forcing numberforcing number\((4, 6)\)-fullerene

Mathematics Subject Classification ID

Applications of graph theory (05C90) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Related Items

The anti-forcing spectra of \(( 4 , 6 )\)-fullerenes, Some novel minimax results for perfect matchings of hexagonal systems, Maximizing the minimum and maximum forcing numbers of perfect matchings of graphs, Forcing and anti-forcing polynomials of a type of polyomino graphs, Forcing and anti-forcing polynomials of perfect matchings for some rectangle grids, Counting clar structures of \((4,6)\)-fullerenes, Anti-forcing polynomials for benzenoid systems with forcing edges, Relations between global forcing number and maximum anti-forcing number of a graph, Some tight bounds on the minimum and maximum forcing numbers of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The maximum forcing number of cylindrical grid, toroidal 4-8 lattice and Klein bottle 4-8 lattice
• Anti-forcing spectra of perfect matchings of graphs
• On forcing matching number of boron-nitrogen fullerene graphs
• Bounds on the forcing numbers of bipartite graphs
• On the anti-Kekulé number and anti-forcing number of cata-condensed benzenoids
• Forcing matching numbers of fullerene graphs
• The minimum forcing number for the torus and hypercube
• Cyclical edge-connectivity of fullerene graphs and \((k,6)\)-cages
• Forcing numbers of stop signs.
• Forcing matchings on square grids
• Anti-forcing spectrum of any cata-condensed hexagonal system is continuous
• Forcing polynomials of benzenoid parallelogram and its related benzenoids
• On the forced matching numbers of bipartite graphs
• Clar structure and fries set of fullerenes and \((4,6)\)-fullerenes on surfaces
• Fullerenes with complete Clar structure
• On the anti-forcing number of benzenoids
• A Minimax Theorem for Directed Graphs
• On the spectrum of the forced matching number of graphs
• Anti-forcing numbers of perfect matchings of graphs