Possible cardinalities of the center of a graph
Yanan Hu, Xingzhi Zhan

TL;DR
This paper investigates the possible sizes of the center of a graph given its order and radius, revealing unexpected phenomena and providing detailed classifications for these cardinalities.
Contribution
It determines which center cardinalities are possible for graphs with specified order and radius, extending prior work on central ratios.
Findings
Identifies possible center sizes for specific graph parameters
Shows existence of graphs with center sizes in particular sets
Proves a related uniqueness result
Abstract
A central vertex of a graph is a vertex whose eccentricity equals the radius. The center of a graph is the set of all central vertices. The central ratio of a graph is the ratio of the cardinality of its center to its order. In 1982, Buckley proved that every positive rational number not exceeding one is the central ratio of some graph. In this paper, we obtain more detailed information by determining which cardinalities are possible for the center of a graph with given order and radius. There are unexpected phenomena in the results. For example, there exists a graph of order and radius whose center has cardinality if and only if We also prove a related uniqueness result.
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 Labeling and Dimension Problems · Graph theory and applications · Advanced Graph Theory Research
