On radius 2 trees with the maximum number of matchings

DOI10.15507/2079-6900.22.202002.177-187OpenAlexW3037769981MaRDI QIDQ6143796

Unnamed Author

Publication date: 24 January 2024

Published in: Zhurnal Srednevolzhskogo Matematicheskogo Obshchestva (Search for Journal in Brave)

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

zbMATH Keywords

treematchingextremal graph theorymolecular graphsordinary graphsmaximum tree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cites Work

• The number of maximum matchings in a tree
• On extremal unicyclic molecular graphs with maximal Hosoya index
• Trees without twin-leaves with smallest number of maximal independent sets
• Maximal Hosoya index and extremal acyclic molecular graphs without perfect matching
• The largest Hosoya index of \((n,n+1)\)-graphs
• Maximal independent sets in bipartite graphs
• A Note on Independent Sets in Trees
• On Trees of Bounded Degree with Maximal Number of Greatest Independent Sets
• The Number of Maximal Independent Sets in Triangle-Free Graphs
• Maximizing the number of independent subsets over trees with bounded degree
• On cliques in graphs
• The number of maximum independent sets in graphs

This page was built for publication: On radius 2 trees with the maximum number of matchings