On the metric subgraphs of a graph
Yanan Hu, Xingzhi Zhan

TL;DR
This paper investigates the existence and properties of graphs whose metric subgraphs—center, annulus, and periphery—are all paths, cycles, or regular graphs, providing specific existence conditions and open problems.
Contribution
It characterizes when graphs with specific types of metric subgraphs exist and determines their possible orders, advancing understanding of graph metric structures.
Findings
Graphs with all path metric subgraphs exist for n ≥ 13.
Graphs with all cycle metric subgraphs exist for n ≥ 15.
Conditions for graphs with regular metric subgraphs are established.
Abstract
The three subgraphs of a connected graph induced by the center, annulus and periphery are called its metric subgraphs. The main results are as follows. (1) There exists a graph of order whose metric subgraphs are all paths if and only if and the smallest size of such a graph of order is (2) there exists a graph of order whose metric subgraphs are all cycles if and only if and there are exactly three such graphs of order (3) for every integer we determine the possible orders for the existence of a graph whose metric subgraphs are all connected -regular graphs; (4) there exists a graph of order whose metric subgraphs are connected and pairwise isomorphic if and only if and is divisible by An unsolved problem is posed.
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.
