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

DOI10.1134/S0001434624030064zbMATH Open1543.05027MaRDI QIDQ6569605

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

Publication date: 9 July 2024

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

zbMATH Keywords

treeextremal combinatoricsleaf\(z\)-index

Mathematics Subject Classification ID

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Hosoya indices and Merrifield-Simmons indices of graphs with connectivity at most \(K^{\bigstar}\)
• On acyclic molecular graphs with maximal Hosoya index, energy, and short diameter
• On extremal unicyclic molecular graphs with maximal Hosoya index
• A new proof of a result concerning a complete description of \((n, n + 2) \)-graphs with maximum value of the Hosoya index
• On Hosoya Index and Merrifield‐Simmons Index of trees with given domination number
• On diameter $5$ trees with the maximum number of matchings
• On radius 2 trees with the maximum number of matchings

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)