Spectral properties of token graphs

Let G be a graph on n vertices. For a given integer k such that 1≤k≤n, the k-token graph Fk(G) of G is defined as the graph whose vertices are the k-subsets of the vertex set of G, and two of them are adjacent whenever their symmetric difference is a pair of adjacent vertices in G. In this article,...

Full description

Bibliographic Details

Published in:	Linear algebra and its applications Vol. 687; pp. 181 - 206
Main Authors:	Barik, Sasmita, Verma, Piyush
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 15.04.2024
Subjects:	Adjacency spectrum Algebraic connectivity Laplacian spectrum Spectral radius Token graph 05C10 05C75 05C50 Laplacian spectrum Spectral radius Algebraic connectivity Token graph Adjacency spectrum
ISSN:	0024-3795, 1873-1856
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!