On the anti-forcing number of benzenoids

From MaRDI portal
Publication:2468698

DOI10.1007/s10910-006-9133-6zbMath1127.92054OpenAlexW2087090178MaRDI 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




Related Items (23)

The anti-Kekulé number of graphsContinuous forcing spectrum of regular hexagonal polyhexesThe anti-forcing spectra of \(( 4 , 6 )\)-fullerenesSome novel minimax results for perfect matchings of hexagonal systemsCharacterizing the fullerene graphs with the minimum forcing number 3Single coronoid systems with an anti-forcing edgeOn the maximum forcing and anti-forcing numbers of \((4, 6)\)-fullerenesOn anti-Kekulé and \(s\)-restricted matching preclusion problemsOn the anti-Kekulé number of (4, 5, 6)-fullerenesAnti-forcing spectrum of any cata-condensed hexagonal system is continuousMatching anti-forcing polynomials of catacondensed hexagonal systemsForcing and anti-forcing polynomials of a type of polyomino graphsForcing and anti-forcing polynomials of perfect matchings for some rectangle gridsForcing polynomials of benzenoid parallelogram and its related benzenoidsAnti-forcing spectra of perfect matchings of graphsForcing and anti-forcing edges in bipartite graphsExtremal anti-forcing numbers of perfect matchings of graphsPlane elementary bipartite graphs with forcing or anti-forcing edgesAnti-forcing numbers of perfect matchings of graphsAnti-forcing polynomials for benzenoid systems with forcing edgesAnti-forcing number of some specific graphsRelations between global forcing number and maximum anti-forcing number of a graphSome tight bounds on the minimum and maximum forcing numbers of graphs



Cites Work


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