On the anti-forcing number of benzenoids
From MaRDI portal
Publication:2468698
DOI10.1007/s10910-006-9133-6zbMath1127.92054MaRDI QIDQ2468698
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
05C90: Applications of graph theory
92E10: Molecular structure (graph-theoretic methods, methods of differential topology, etc.)
Related Items
Anti-forcing number of some specific graphs, Anti-forcing numbers of perfect matchings of graphs, On anti-Kekulé and \(s\)-restricted matching preclusion problems, Matching anti-forcing polynomials of catacondensed hexagonal systems, Anti-forcing spectra of perfect matchings of graphs, Extremal anti-forcing numbers of perfect matchings of graphs, The anti-Kekulé number of graphs, Anti-forcing spectrum of any cata-condensed hexagonal system is continuous, Forcing and anti-forcing polynomials of perfect matchings for some rectangle grids, Forcing polynomials of benzenoid parallelogram and its related benzenoids, Forcing and anti-forcing edges in bipartite graphs, Anti-forcing polynomials for benzenoid systems with forcing edges, Plane elementary bipartite graphs with forcing or anti-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, 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, On the anti-Kekulé number of (4, 5, 6)-fullerenes, Single coronoid systems with an anti-forcing edge, On the maximum forcing and anti-forcing numbers of \((4, 6)\)-fullerenes, Characterizing the fullerene graphs with the minimum forcing number 3, Forcing and anti-forcing polynomials of a type of polyomino graphs
Cites Work
