Graphs with prescribed radius, diameter, and center
Kelly Guest, Andrew Johnson, Peter Johnson, William Jones, Yuki, Takahashi, Zhichun Joy Zhang

TL;DR
This paper proves that for any given radius, diameter, and center graph satisfying certain conditions, one can construct a connected graph with those properties, demonstrating a flexible relationship among these parameters.
Contribution
It introduces a method to construct connected graphs with prescribed radius, diameter, and center, expanding understanding of graph parameter realizability.
Findings
Existence of connected graphs with specified radius, diameter, and center for given parameters.
Construction method applicable to any finite simple graph as center.
Parameter constraints: 1<r<d≤2r.
Abstract
Among other things, it is shown that for every pair of positive integers , , satisfying , and every finite simple graph there is a connected graph with diameter , radius , and center
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Advanced Graph Theory Research · Graph Labeling and Dimension Problems
