Geodetic graphs minimize the geodesic subpath number while an upper bound is established for general graphs on n vertices and extremal structures are characterized among cactus graphs.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Counting geodesic paths in graphs
Geodetic graphs minimize the geodesic subpath number while an upper bound is established for general graphs on n vertices and extremal structures are characterized among cactus graphs.