Tight upper bound on the maximum anti-forcing numbers of graphs

zbMath1401.05242arXiv1704.04124MaRDI QIDQ4560210

Lingjuan Shi, Heping Zhang

Publication date: 10 December 2018

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

zbMATH Keywords

hypercubeCartesian productperfect matchingfolded hypercubemaximum anti-forcing numberedge-involution

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)

Related Items (7)

The anti-forcing spectra of \(( 4 , 6 )\)-fullerenes ⋮ Some novel minimax results for perfect matchings of 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 ⋮ 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

This page was built for publication: Tight upper bound on the maximum anti-forcing numbers of graphs