Counting geodesic paths in graphs

DOI10.1007/S00009-026-03159-3MaRDI QIDQ7323360zbMATH OpenFDO

Authors Martin Knor, Jelena Sedlar, Riste Škrekovski, Xiao-Dong Zhang

Publication date 1 September 2026

Published in Mediterranean Journal of Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00009-026-03159-3

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38)

Cites work

• A formula for the number of spanning trees of a multi-star related graph
• An efficient approach for counting the number of spanning trees in circulant and related graphs
• Approximately counting paths and cycles in a graph
• Binary trees with the largest number of subtrees
• Counting spanning trees using modular decomposition
• Drawing Shortest Paths in Geodetic Graphs
• Invitation to the subpath number
• Laplacian spectrum of weakly quasi-threshold graphs
• 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 graphs with unique geoodesics and antipodes
• On subtrees of trees
• On the number of spanning trees of multi-star related graphs
• Resolving vertices of graphs with differences
• Rewriting systems, plain groups, and geodetic graphs
• Selected topics on Wiener index
• Some methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenes
• 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
• The subpath number of cactus graphs
• Two extensions of Leech labeling to the class of all graphs

This page was built for publication: Counting geodesic paths in graphs

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