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

DOI10.1134/S0001434622010291MaRDI QIDQ2113426zbMATH OpenOpenAlexFDO

Authors N. A. Kuz'min, D. 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

Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) 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) Chemical graph theory (05C92)

Recommendations

• The largest Hosoya index of (n,n+1)-graphs
• On the Hosoya index of graphs
• The \((n,m)\)-graphs of minimum Hosoya index
• The proof of a conjecture concerning acyclic molecular graphs with maximal Hosoya index and diameter 4
• The greatest Hosoya index of bicyclic graphs with given maximum degree

Cites work

• Largest Hosoya index and smallest Merrifield-Simmons index in tricyclic graphs
• Mutually-recursive formulas for enumerating partitions of the rectangle
• On extremal unicyclic molecular graphs with maximal Hosoya index
• The largest Hosoya index of (n,n+1)-graphs

Cited in

(1)

• On 5- and 6-leaved trees with the largest number of matchings

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

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