On the spectra of token graphs of cycles and other graphs
M\'onica. A. Reyes, Cristina Dalf\'o, Miquel \`Angel Fiol, and Arnau, Messegu\'e

TL;DR
This paper investigates the spectral properties of token graphs derived from cycles and other graphs, providing new methods to compute spectra and relating algebraic connectivities before and after vertex removal.
Contribution
It introduces a novel approach to compute the entire spectrum of 2-token graphs of cycles and extends algebraic connectivity results to specific graph families.
Findings
Spectra of 2-token graphs of cycles are explicitly computed.
Asymptotic formulas for eigenvalues of 2-token cycle graphs are derived.
Algebraic connectivity relations are established for token graphs after vertex removal.
Abstract
The -token graph of a graph is the graph whose vertices are the -subsets of vertices from , two of which being adjacent whenever their symmetric difference is a pair of adjacent vertices in . It is a known result that the algebraic connectivity (or second Laplacian eigenvalue) of equals the algebraic connectivity of . In this paper, we first give results that relate the algebraic connectivities of a token graph and the same graph after removing a vertex. Then, we prove the result on the algebraic connectivity of 2-token graphs for two infinite families: the odd graphs for all , and the multipartite complete graphs for all In the case of cycles, we present a new method that allows us to compute the whole spectrum of . This method also allows us to obtain closed formulas that give…
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 · Synthesis and Properties of Aromatic Compounds · Advanced NMR Techniques and Applications
