Regularity and planarity of token graphs
From MaRDI portal
Publication:2364080
DOI10.7151/dmgt.1959zbMath1366.05028arXiv1510.00424OpenAlexW2192627873MaRDI QIDQ2364080
Walter Carballosa, Ruy Fabila-Monroy, Jesús Leaños, Luis Manuel Rivera
Publication date: 17 July 2017
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1510.00424
Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (16)
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 ⋮ Automorphism group of 2-token graph of the Hamming graph ⋮ The automorphism groups of some token graphs ⋮ Spectral properties of token graphs ⋮ Entanglement entropy bounds for droplet states of the XXZ model on the strip ⋮ The automorphisms of 2-token graphs ⋮ A Schrödinger operator approach to higher spin XXZ systems on general graphs ⋮ Entanglement entropy bounds in the higher spin XXZ chain ⋮ Independence and matching numbers of some token graphs ⋮ Hamiltonicity of token graphs of fan graphs ⋮ On the Laplacian spectra of token graphs ⋮ The edge-connectivity of token graphs
Uses Software
Cites Work
- Unnamed Item
- Metric dimension of some distance-regular graphs
- On the chromatic number, colorings, and codes of the Johnson graph
- Token graphs
- Sporadic neighbour-transitive codes in Johnson graphs
- Practical graph isomorphism. II.
- Neighbour-transitive codes in Johnson graphs
- Über eine Eigenschaft der ebenen Komplexe
- On the Cutting Edge: Simplified O(n) Planarity by Edge Addition
- Lower bounds for constant weight codes
- On Topological Invariants of the Product of Graphs
This page was built for publication: Regularity and planarity of token graphs
