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

DOI10.1134/S0001434624030064MaRDI QIDQ6569605zbMATH OpenFDO

Authors D. S. Malyshev

Publication date 9 July 2024

Published in Mathematical Notes (Search for Journal in Brave)

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

zbMATH Keywords

\(z\)-indexextremal combinatoricsleaftree

Mathematics Subject Classification ID

Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Extremal problems in graph theory (05C35) Chemical graph theory (05C92) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Recommendations

• On diameter $5$ trees with the maximum number of matchings
• Some graphs with minimum Hosoya index and maximum Merrifield--Simmons index
• The largest Hosoya index of (n,n+1)-graphs
• Bounds of the Hosoya index in graphs
• On the Hosoya index of graphs

Cites work

• A new proof of a result concerning a complete description of \((n, n + 2) \)-graphs with maximum value of the Hosoya index
• scientific article; zbMATH DE number 5251556 (Why is no real title available?)
• Largest Hosoya index and smallest Merrifield-Simmons index in tricyclic graphs
• On acyclic molecular graphs with maximal Hosoya index, energy, and short diameter
• On diameter $5$ trees with the maximum number of matchings
• On extremal unicyclic molecular graphs with maximal Hosoya index
• On Hosoya Index and Merrifield‐Simmons Index of trees with given domination number
• On radius 2 trees with the maximum number of matchings
• On the maximal energy and the Hosoya index of a type of trees with many pendant vertices
• The greatest Hosoya index of bicyclic graphs with given maximum degree
• The Hosoya indices and Merrifield-Simmons indices of graphs with connectivity at most \(K^{\bigstar}\)
• The second largest Hosoya index of unicyclic graphs

Cited in

(6)

• On diameter $5$ trees with the maximum number of matchings
• On radius 2 trees with the maximum number of matchings
• A solution of the open problem on total irregularity of trees with specified leaves
• Enumerating the number of k-matchings in successively amalgamated graphs
• On the Szeged-Sombor index of graphs
• On irregularity measures in trees with Fibonacci degree sequences

This page was built for publication: On 5- and 6-leaved trees with the largest number of matchings

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