On diameter $5$ trees with the maximum number of matchings

DOI10.4213/SM9745EzbMATH Open1529.05048MaRDI QIDQ6137418

D. S. Malyshev, Author name not available (Why is that?)

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

treematchingextremal graph theory

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) 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)

Related Items (1)

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)