Some bounds on the Laplacian eigenvalues of token graphs

The k-token graph Fk(G) of a graph G on n vertices is the graph whose vertices are the (nk)k-subsets of vertices from G, two of which are adjacent whenever their symmetric difference is a pair of adjacent vertices in G. It is known that the algebraic connectivity (or second Laplacian eigenvalue) of...

Full description

Bibliographic Details

Published in:	Discrete mathematics Vol. 348; no. 4; p. 114382
Main Authors:	Dalfó, C., Fiol, M.A., Messegué, A.
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.04.2025
Subjects:	Algebraic connectivity Binomial matrix Laplacian spectrum Token graph Algebraic connectivity Token graph Binomial matrix Laplacian spectrum
ISSN:	0012-365X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!