Regularity and Planarity of Token Graphs

Walter Carballosa, et al. "Regularity and Planarity of Token Graphs." Discussiones Mathematicae Graph Theory 37.3 (2017): 573-586. <http://eudml.org/doc/288582>.

@article{WalterCarballosa2017,
abstract = {Let G = (V, E) be a graph of order n and let 1 ≤ k < n be an integer. The k-token graph of G is the graph whose vertices are all the k-subsets of V, two of which are adjacent whenever their symmetric difference is a pair of adjacent vertices in G. In this paper we characterize precisely, for each value of k, which graphs have a regular k-token graph and which connected graphs have a planar k-token graph.},
author = {Walter Carballosa, Ruy Fabila-Monroy, Jesús Leaños, Luis Manuel Rivera},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {token graph; Johnson graph; regularity; planarity},
language = {eng},
number = {3},
pages = {573-586},
title = {Regularity and Planarity of Token Graphs},
url = {http://eudml.org/doc/288582},
volume = {37},
year = {2017},
}

TY - JOUR
AU - Walter Carballosa
AU - Ruy Fabila-Monroy
AU - Jesús Leaños
AU - Luis Manuel Rivera
TI - Regularity and Planarity of Token Graphs
JO - Discussiones Mathematicae Graph Theory
PY - 2017
VL - 37
IS - 3
SP - 573
EP - 586
AB - Let G = (V, E) be a graph of order n and let 1 ≤ k < n be an integer. The k-token graph of G is the graph whose vertices are all the k-subsets of V, two of which are adjacent whenever their symmetric difference is a pair of adjacent vertices in G. In this paper we characterize precisely, for each value of k, which graphs have a regular k-token graph and which connected graphs have a planar k-token graph.
LA - eng
KW - token graph; Johnson graph; regularity; planarity
UR - http://eudml.org/doc/288582
ER -