Regularity and Planarity of Token Graphs

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

Full description

Bibliographic Details
Main Authors: Carballosa Walter, Fabila-Monroy Ruy, Leaños Jesús, Rivera Luis Manuel
Format: Article
Language:English
Published: University of Zielona Góra 2017-08-01
Series:Discussiones Mathematicae Graph Theory
Subjects:
Online Access:https://doi.org/10.7151/dmgt.1959