Anti-forcing polynomials for benzenoid systems with forcing edges

DOI10.1016/J.DAM.2018.05.023zbMath1398.05167OpenAlexW2807321273MaRDI QIDQ1801080

Heping Zhang, Shuang Zhao

Publication date: 26 October 2018

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

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

zbMATH Keywords

perfect matchinganti-forcing numberbenzenoid systemanti-forcing polynomialforcing edge

Mathematics Subject Classification ID

Graph polynomials (05C31) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (4)

The anti-forcing spectra of \(( 4 , 6 )\)-fullerenes ⋮ Matching anti-forcing polynomials of catacondensed hexagonal systems ⋮ Forcing and anti-forcing polynomials of a type of polyomino graphs ⋮ Forcing and anti-forcing polynomials of perfect matchings for some rectangle grids

Cites Work

• 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
• 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
• Hexagonal systems with forcing edges
• On the maximum forcing and anti-forcing numbers of \((4, 6)\)-fullerenes
• On the anti-forcing number of benzenoids
• A Minimax Theorem for Directed Graphs
• Compositions of Graphs and Polyhedra IV: Acyclic Spanning Subgraphs
• Tight upper bound on the maximum anti-forcing numbers of graphs
• Anti-forcing numbers of perfect matchings of graphs

This page was built for publication: Anti-forcing polynomials for benzenoid systems with forcing edges