A new proof of a result concerning a complete description of \((n, n + 2) \)-graphs with maximum value of the Hosoya index

DOI10.1134/S0001434622010291zbMath1484.05053OpenAlexW4213455998MaRDI QIDQ2113426

N. A. Kuz'min, Dmitriy S. Malyshev

Publication date: 14 March 2022

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0001434622010291

zbMATH Keywords

matchingextremal combinatorics

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) 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
• On extremal unicyclic molecular graphs with maximal Hosoya index
• The largest Hosoya index of \((n,n+1)\)-graphs
• MUTUALLY-RECURSIVE FORMULAS FOR ENUMERATING PARTITIONS OF THE RECTANGLE

This page was built for publication: A new proof of a result concerning a complete description of \((n, n + 2) \)-graphs with maximum value of the Hosoya index