The subpath number of cactus graphs

DOI10.1007/S40314-025-03545-9MaRDI QIDQ6867371zbMATH OpenFDO

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

Publication date 28 January 2026

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S40314-025-03545-9

zbMATH Keywords

cactus graphscycle chainsextremal graphssubpath numbersubtree numberWiener index

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Enumeration in graph theory (05C30) Extremal problems in graph theory (05C35)

Cites work

• A unified approach to extremal cacti for different indices
• Approximately counting paths and cycles in a graph
• 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
• Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees
• 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 enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees
• On subtrees of trees
• Selected topics on Wiener index
• The expected subtree number index in random polyphenylene and spiro chains
• The extremal average distance of cubic graphs
• 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

(1)

• Counting geodesic paths in graphs

This page was built for publication: The subpath number of cactus graphs

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