Anti-forcing spectra of perfect matchings of graphs

DOI10.1007/s10878-015-9986-3zbMath1390.90548OpenAlexW2287814470MaRDI QIDQ511717

Kai Deng, Heping Zhang

Publication date: 22 February 2017

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-015-9986-3

zbMATH Keywords

perfect matchinganti-forcing numberhexagonal systemanti-forcing spectrum

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items

Matching Forcing Polynomials of Constructable Hexagonal Systems ⋮ The anti-forcing spectra of \(( 4 , 6 )\)-fullerenes ⋮ Some novel minimax results for perfect matchings of hexagonal systems ⋮ On the maximum forcing and anti-forcing numbers of \((4, 6)\)-fullerenes ⋮ Forcing and anti-forcing polynomials of a type of polyomino graphs ⋮ Forcing and anti-forcing polynomials of perfect matchings for some rectangle grids ⋮ 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 ⋮ Relation between the Hermitian energy of a mixed graph and the matching number of its underlying graph ⋮ Relations between global forcing number and maximum anti-forcing number of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On forcing matching number of boron-nitrogen fullerene graphs
• Hexagonal systems with forcing single edges
• The connectivity of Z-transformation graphs of perfect matchings of hexagonal systems
• The forcing number of toroidal polyhexes
• On the anti-Kekulé number and anti-forcing number of cata-condensed benzenoids
• Forcing matching numbers of fullerene graphs
• Matching theory
• The minimum forcing number for the torus and hypercube
• Plane elementary bipartite graphs
• Forcing matchings on square grids
• Z-transformation graphs of perfect matchings of hexagonal systems
• On the forced matching numbers of bipartite graphs
• Hexagonal systems with forcing edges
• On the anti-forcing number of benzenoids
• On the spectrum of the forced matching number of graphs
• Centroids, Representations, and Submodular Flows
• Reducibility among Combinatorial Problems
• On the anti-forcing number of fullerene graphs
• Anti-forcing numbers of perfect matchings of graphs