Subtree number versus Wiener index

DOI10.46793/MATCH.96-3.25225MaRDI QIDQ7232974zbMATH OpenFDO

Authors Martin Knor, Jelena Sedlar, Riste Škrekovski, Yu Yang

Publication date 23 April 2026

Published in MATCH - Communications in Mathematical and in Computer Chemistry (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.46793/MATCH.96-3.25225

Mathematics Subject Classification ID

Biology and other natural sciences (92-XX)

Cites work

• Binary trees with the largest number of subtrees
• Cacti with \(n\)-vertices and \(t\) cycles having extremal Wiener index
• Comparative results between the number of subtrees and Wiener index of graphs
• Invitation to the subpath number
• Largest Number of Subtrees of Trees with a Given Maximum Degree
• Mathematical aspects of Wiener index
• Maximum number of subtrees in cacti and block graphs
• On subtrees of trees
• On the eccentric subtree number in trees
• Selected topics on Wiener index
• Subtrees and independent subsets in unicyclic graphs and unicyclic graphs with fixed segment sequence
• Superdominance order and distance of trees with bounded maximum degree
• The inverse problem for certain tree parameters
• The number of subtrees in graphs with given number of cut edges
• The number of subtrees of trees with given degree sequence
• Wiener index versus maximum degree in trees
• Wiener index, number of subtrees, and tree eccentric sequence

This page was built for publication: Subtree number versus Wiener index

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