On the Number of Shortest Paths in Graphs
Abstract
It is proved that the number of shortest paths between two vertices of distance t in a graph with degrees bounded by is at most 2 · (2)t. This improves upon the na\"ive (-1) t-1 bound.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.