On the algebraic connectivity of token graphs and graphs under perturbations

Given a graph G=(V,E) on n vertices and an integer k between 1 and n−1, the k-token graph Fk(G) has vertices representing the k-subsets of V, and two vertices are adjacent if their symmetric difference is the two end-vertices of an edge in E. Using the theory of Markov chains of random walks and the...

Full description

Bibliographic Details

Published in:	Discrete Applied Mathematics Vol. 377; pp. 134 - 146
Main Authors:	Song, Xiaodi, Dalfó, Cristina, Fiol, Miquel Àngel, Zhang, Shenggui
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 31.12.2025
Subjects:	Algebraic connectivity Binomial matrix Cut clique Kite graph Laplacian spectrum Token graph Algebraic connectivity Kite graph Token graph Binomial matrix Cut clique Laplacian spectrum
ISSN:	0166-218X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!