Graphs with prescribed radius, diameter, and center
Abstract
Among other things, it is shown that for every pair of positive integers r, d, satisfying 1<r<d≤ 2r, and every finite simple graph H, there is a connected graph G with diameter d, radius r, and center H.
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.