On the algebraic connectivity of some token graphs

The k -token graph F k ( G ) of a graph G is the graph whose vertices are the k -subsets of vertices from G , two of which are adjacent whenever their symmetric difference is a pair of adjacent vertices in G . It was proved that the algebraic connectivity of F k ( G ) equals the algebraic connectivi...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of algebraic combinatorics Ročník 60; číslo 1; s. 45 - 56
Hlavní autori:	Dalfó, C., Fiol, M. A.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.08.2024 Springer Nature B.V
Predmet:	Algebra Apexes Combinatorial analysis Combinatorics Computer Science Connectivity Convex and Discrete Geometry Eigenvalues Eigenvectors Graph theory Graphs Group Theory and Generalizations Lattices Mathematics Mathematics and Statistics Order Ordered Algebraic Structures Random walk Trees (mathematics) 05C10 05C50 Laplacian spectrum Algebraic connectivity Token graph Binomial matrix 05C15
ISSN:	0925-9899, 1572-9192
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!