The anti-forcing number of hexagonal chains

zbMATH Open1142.05354MaRDI QIDQ5454413FDOQ5454413

Hanyuan Deng

Publication date: 28 March 2008

Recommendations

• The anti-forcing number of double hexagonal chains
• Anti-forcing numbers of perfect matchings of graphs
• Anti-forcing number of some specific graphs
• Some novel minimax results for perfect matchings of hexagonal systems
• The minimum forcing and anti-forcing numbers of convex hexagonal systems

zbMATH Keywords

perfect matchinghexagonal systems

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (13)

• Anti-forcing polynomials for benzenoid systems with forcing edges
• Plane elementary bipartite graphs with forcing or anti-forcing edges
• Anti-forcing spectrum of any cata-condensed hexagonal system is continuous
• Title not available (Why is that?)
• Forcing and anti-forcing edges in bipartite graphs
• Some novel minimax results for perfect matchings of hexagonal systems
• Matching anti-forcing polynomials of catacondensed hexagonal systems
• Single coronoid systems with an anti-forcing edge
• Anti-forcing spectra of perfect matchings of graphs
• Extremal anti-forcing numbers of perfect matchings of graphs
• The anti-forcing spectra of \(( 4 , 6 )\)-fullerenes
• Anti-forcing numbers of perfect matchings of graphs
• On the maximum forcing and anti-forcing numbers of \((4, 6)\)-fullerenes

This page was built for publication: The anti-forcing number of hexagonal chains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5454413)