The Edge-connectivity of Token Graphs
J. Lea\~nos, M. K. Christophe Ndjatchi

TL;DR
This paper extends known vertex connectivity results of token graphs to edge connectivity, proving that the edge connectivity of the token graph is at least k(t-k+1) when the original graph is t-edge-connected.
Contribution
It establishes a new lower bound for the edge connectivity of token graphs based on the edge connectivity of the original graph, generalizing previous vertex connectivity results.
Findings
The edge connectivity of the token graph is at least k(t-k+1) when the original graph is t-edge-connected.
The bound is tight for certain families of graphs.
The result generalizes prior vertex connectivity bounds to edge connectivity.
Abstract
Let be a simple graph of order and let . The -token graph of is the graph whose vertices are the -subsets of , where two vertices are adjacent in whenever their symmetric difference is an edge of . In 2018 J. Lea\~nos and A. L. Trujillo-Negrete proved that if is -connected and , then is at least -connected. In this paper we show that such a lower bound remains true in the context of edge-connectivity. Specifically, we show that if is -edge-connected and , then is at least -edge-connected. We also provide some families of graphs attaining this bound.
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
TopicsInterconnection Networks and Systems · Advanced Graph Theory Research · Advanced biosensing and bioanalysis techniques
