On the Laplacian spectra of token graphs
C. Dalf\'o, F. Duque, R. Fabila-Monroy, M. A. Fiol, C. Huemer, A. L., Trujillo-Negrete, F. J. Zaragoza Mart\'inez

TL;DR
This paper investigates the Laplacian spectra of token graphs, revealing spectral relationships between different token graphs of a given graph and identifying specific families with coinciding algebraic connectivities.
Contribution
It establishes spectral inclusion relations between token graphs of different sizes and connects spectra of a graph and its complement, extending known eigenvalue properties.
Findings
Spectral inclusion: Laplacian spectrum of F_h(G) is contained in that of F_k(G) for h ≤ k.
Double odd and doubled Johnson graphs are token graphs of complete and star graphs.
Algebraic connectivities of certain token graphs and original graphs coincide.
Abstract
We study the Laplacian spectrum of token graphs, also called symmetric powers of graphs. 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 . In this paper, we give a relationship between the Laplacian spectra of any two token graphs of a given graph. In particular, we show that, for any integers and such that , the Laplacian spectrum of is contained in the Laplacian spectrum of . We also show that the double odd graphs and doubled Johnson graphs can be obtained as token graphs of the complete graph and the star , respectively. Besides, we obtain a relationship between the spectra of the -token graph of and the -token graph of its complement…
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 · Finite Group Theory Research
