The anti-Kekulé number of graphs
DOI10.1007/s10910-021-01221-xzbMath1462.05084OpenAlexW3131285759WikidataQ112879527 ScholiaQ112879527MaRDI QIDQ830774
Publication date: 10 May 2021
Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10910-021-01221-x
Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Chemical graph theory (05C92)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computation of topological indices of certain networks
- Hexagonal resonance of (3,6)-fullerenes
- Extremal polyomino chains with respect to Zagreb indices
- A note on the cyclical edge-connectivity of fullerene graphs
- On the anti-Kekulé number and anti-forcing number of cata-condensed benzenoids
- Cyclic edge-cuts in fullerene graphs
- On cyclic edge-connectivity of fullerenes
- On the anti-Kekulé number of leapfrog fullerenes
- When each hexagon of a hexagonal system covers it
- Cyclical edge-connectivity of fullerene graphs and \((k,6)\)-cages
- Plane elementary bipartite graphs
- New lower bound on the number of perfect matchings in fullerene graphs
- Wiener index of hexagonal systems
- Normal components, Kekulé patterns, and Clar patterns in plane bipartite graphs
- On some extremal problems in graph theory
- On the anti-Kekulé number and odd cycle transversal of regular graphs
- On the anti-forcing number of benzenoids
- The Anti-Kekule number of the infinite triangular, rectangular and hexagonal grids
- Odd Cycle Transversals and Independent Sets in Fullerene Graphs
- The Factorization of Linear Graphs
This page was built for publication: The anti-Kekulé number of graphs
