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...

Celý popis

Podrobná bibliografia

Vydané v:	Discrete Applied Mathematics Ročník 377; s. 134 - 146
Hlavní autori:	Song, Xiaodi, Dalfó, Cristina, Fiol, Miquel Àngel, Zhang, Shenggui
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 31.12.2025
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!