Invitation to the subpath number

DOI10.1016/J.AMC.2025.129646MaRDI QIDQ6897161zbMATH OpenFDO

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

Publication date 20 November 2025

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.AMC.2025.129646

Mathematics Subject Classification ID

Enumerative combinatorics (05Axx) Graph theory (05Cxx) Chemistry (92Exx)

Cites work

• Approximately counting paths and cycles in a graph
• Binary trees with the largest number of subtrees
• Comparative results between the number of subtrees and Wiener index of graphs
• Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees
• 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 enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees
• On subtrees of trees
• Selected topics on Wiener index
• 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

Cited in

(4)

• The subpath number of cactus graphs
• Exact counting of subtrees with diameter no more than d in trees: a generating function approach
• Subtree number versus Wiener index
• Counting geodesic paths in graphs

This page was built for publication: Invitation to the subpath number

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