On the anti-forcing number of benzenoids

DOI10.1007/S10910-006-9133-6MaRDI QIDQ2468698zbMATH OpenOpenAlexFDO

Authors Damir Vukičević, Nenad Trinajstić

Publication date 25 January 2008

Published in Journal of Mathematical Chemistry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10910-006-9133-6

zbMATH Keywords

forcing numberdamaged benzenoid paralleograms

Mathematics Subject Classification ID

Applications of graph theory (05C90) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Recommendations

• On the anti-Kekulé number and anti-forcing number of cata-condensed benzenoids
• On the anti-Kekulé and anti-forcing number of cata-condensed phenylenes
• Anti-forcing polynomials for benzenoid systems with forcing edges
• The anti-forcing number of double hexagonal chains
• The anti-forcing number of hexagonal chains

Cites work

• scientific article; zbMATH DE number 4083659 (Why is no real title available?)
• scientific article; zbMATH DE number 2152546 (Why is no real title available?)
• Forcing matchings on square grids
• Hexagonal systems with forcing edges

Cited in

(38)

• Forcing polynomials of benzenoid parallelogram and its related benzenoids
• Anti-forcing polynomials for benzenoid systems with forcing edges
• On the anti-Kekulé number and anti-forcing number of cata-condensed benzenoids
• Complete Forcing Numbers of Polyphenyl Systems
• On the anti-forcing number of graph powers
• Anti-forcing number of some specific graphs
• On the anti-Kekulé and anti-forcing number of cata-condensed phenylenes
• Plane elementary bipartite graphs with forcing or anti-forcing edges
• Finding spanning trees with perfect matchings
• The anti-Kekulé number of graphs
• Anti-forcing spectrum of any cata-condensed hexagonal system is continuous
• On anti-Kekulé and s-restricted matching preclusion problems
• Continuous forcing spectrum of regular hexagonal polyhexes
• Complete forcing numbers of (4, 6)-fullerenes
• The complexity of pre-assignment problem for unique minimum vertex cover on bipartite graphs
• Characterizing the fullerene graphs with the minimum forcing number 3
• Fractional forcing number of graphs
• Forcing and anti-forcing edges in bipartite graphs
• Analytic properties of forcing and anti-forcing polynomials of pyrene chains
• Hardness of pre-assignment problem for unique minimum vertex cover on planar graphs with maximum degree 3
• Some novel minimax results for perfect matchings of hexagonal systems
• Matching anti-forcing polynomials of catacondensed hexagonal systems
• The d-blocker number and d-transversal number of hexagonal systems
• Computing the forcing spectrum of outerplanar graphs in polynomial time
• On the anti-Kekulé number of (4, 5, 6)-fullerenes
• Forcing bonds of a benzenoid system
• Forcing and anti-forcing polynomials of a type of polyomino graphs
• Single coronoid systems with an anti-forcing edge
• Some novel minimax results for perfect matchings of polyomino graphs
• Relations between global forcing number and maximum anti-forcing number of a graph
• 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
• Forcing, anti-forcing, global forcing and complete forcing on perfect matchings of graphs -- a survey
• Anti-forcing numbers of perfect matchings of graphs
• Some tight bounds on the minimum and maximum forcing numbers of graphs
• On the maximum forcing and anti-forcing numbers of (4, 6)-fullerenes
• Forcing and anti-forcing polynomials of perfect matchings for some rectangle grids

This page was built for publication: On the anti-forcing number of benzenoids

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