Regularity and planarity of token graphs

From MaRDI portal
Publication:2364080




Abstract: Let G=(V,E) be a graph of order n and let 1leqk<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.





Describes a project that uses

Uses Software





This page was built for publication: Regularity and planarity of token graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2364080)