On diameter 5 trees with the maximum number of matchings

DOI10.4213/SM9745EMaRDI QIDQ6137418zbMATH OpenFDO

Authors D. S. Malyshev

Publication date 2 September 2023

Published in Sbornik: Mathematics (Search for Journal in Brave)

Full work available at URL http://mathnet.ru/eng/sm9745

zbMATH Keywords

extremal graph theorymatchingtree

Mathematics Subject Classification ID

Trees (05C05) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Enumeration in graph theory (05C30) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Chemical graph theory (05C92) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Recommendations

• On 5- and 6-leaved trees with the largest number of matchings
• Some graphs with minimum Hosoya index and maximum Merrifield--Simmons index
• The proof of a conjecture concerning acyclic molecular graphs with maximal Hosoya index and diameter 4
• scientific article; zbMATH DE number 5584801
• On acyclic molecular graphs with maximal Hosoya index, energy, and short diameter

Cited in

(2)

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

This page was built for publication: On diameter $5$ trees with the maximum number of matchings

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