Token graphs

DOI10.1007/s00373-011-1055-9zbMath1256.05201arXiv0910.4774OpenAlexW2913469604WikidataQ61732481 ScholiaQ61732481MaRDI QIDQ1926040

Jorge Urrutia, David R. Wood, Ruy Fabila-Monroy, Clemens Huemer, David Flores-Peñaloza, Ferran Hurtado

Publication date: 27 December 2012

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0910.4774

zbMATH Keywords

diameterconnectivitychromatic numberCartesian productscliquesHamiltonian pathsJohnson graphstoken graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Related Items

Regularity and planarity of token graphs, Droplet states in quantum XXZ spin systems on general graphs, Edge-transitive token graphs, The packing number of the double vertex graph of the path graph, The connectivity of token graphs, On the Connectivity of Token Graphs of Trees, Token Swapping on Trees, Automorphism group of 2-token graph of the Hamming graph, On the spectra of token graphs of cycles and other graphs, Reconfiguration of connected graph partitions, On reconfiguration graphs of independent sets under token sliding, The automorphism groups of some token graphs, Spectral properties of token graphs, On the 2-Token Graphs of Some Disjoint Union of Graphs, Graphs isomorphisms under edge-replacements and the family of amoebas, On the spectra and spectral radii of token graphs, On the spectra and eigenspaces of the universal adjacency matrices of arbitrary lifts of graphs, The automorphisms of 2-token graphs, On the 2-token graph of a graph, Independence and matching numbers of some token graphs, Complexity of token swapping and its variants, Hamiltonicity of token graphs of fan graphs, On the Laplacian spectra of token graphs, The edge-connectivity of token graphs, Computing spectral bounds of the Heisenberg ferromagnet from geometric considerations, Introduction to reconfiguration

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The exact bound in the Erdős-Ko-Rado theorem
• On large sets of disjoint Steiner triple systems. I
• A completion of Lu's determination of the spectrum for large sets of disjoint Steiner triple systems
• A linear-time algorithm for the feasibility of pebble motion on trees
• An algorithm for two-dimensional rigidity percolation: The pebble game
• On the number of odd binomial coefficients
• On the chromatic number, colorings, and codes of the Johnson graph
• The chip-firing game
• A new existence proof for large sets of disjoint Steiner triple systems
• Number of Odd Binomial Coefficients
• Graph reconstruction—a survey
• A Survey of Combinatorial Gray Codes