Anti-forcing numbers of perfect matchings of graphs

DOI10.1016/j.dam.2015.08.024zbMath1330.05131arXiv1406.3796OpenAlexW1488229411MaRDI QIDQ5962519

Heping Zhang, Yeong-Nan Yeh, Hongchuan Lei

Publication date: 12 February 2016

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

Full work available at URL: https://arxiv.org/abs/1406.3796

zbMATH Keywords

perfect matchinganti-forcing numberforcing numberFries numberhexagonal systemplane bipartite graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Applications of graph theory (05C90) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (20)

Matching Forcing Polynomials of Constructable Hexagonal Systems ⋮ Continuous forcing spectrum of regular hexagonal polyhexes ⋮ The anti-forcing spectra of \(( 4 , 6 )\)-fullerenes ⋮ Some novel minimax results for perfect matchings of hexagonal systems ⋮ Single coronoid systems with an anti-forcing edge ⋮ On the maximum forcing and anti-forcing numbers of \((4, 6)\)-fullerenes ⋮ Anti-forcing spectrum of any cata-condensed hexagonal system is continuous ⋮ 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 ⋮ Forcing polynomials of benzenoid parallelogram and its related benzenoids ⋮ Anti-forcing spectra of perfect matchings of graphs ⋮ Forcing and anti-forcing edges in bipartite graphs ⋮ Extremal anti-forcing numbers of perfect matchings of graphs ⋮ Plane elementary bipartite graphs with forcing or anti-forcing edges ⋮ Anti-forcing polynomials for benzenoid systems with forcing edges ⋮ Anti-forcing number of some specific graphs ⋮ 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 ⋮ Complete forcing numbers of graphs

Cites Work

• Hexagonal systems with forcing single edges
• Unimodularity of the Clar number problem
• On the anti-Kekulé number and anti-forcing number of cata-condensed benzenoids
• Forcing matching numbers of fullerene graphs
• A maximal cover of hexagonal systems
• Matching theory
• On two minimax theorems in graph
• The minimum forcing number for the torus and hypercube
• Plane elementary bipartite graphs
• Forcing matchings on square grids
• On the forced matching numbers of bipartite graphs
• Normal components, Kekulé patterns, and Clar patterns in plane bipartite graphs
• Hexagonal systems with forcing edges
• Independent domination in graphs: A survey and recent results
• On the anti-forcing number of benzenoids
• A Minimax Theorem for Directed Graphs
• On the spectrum of the forced matching number of graphs
• Perfect matchings in hexagonal systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Anti-forcing numbers of perfect matchings of graphs