Garland's method for token graphs

The k-th token graph of a graph G=(V,E) is the graph Fk(G) whose vertices are the k-subsets of V and whose edges are all pairs of k-subsets A,B such that the symmetric difference of A and B forms an edge in G. Let L(G) be the Laplacian matrix of G, and Lk(G) be the Laplacian matrix of Fk(G). It was...

Full description

Bibliographic Details

Published in:	Linear algebra and its applications Vol. 700; pp. 50 - 60
Main Author:	Lew, Alan
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.11.2024
Subjects:	Garland's method Laplacian Token graphs Token graphs Garland's method 05C50 Laplacian
ISSN:	0024-3795
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!