The edge-connectivity of token graphs
From MaRDI portal
Publication:2045395
DOI10.1007/s00373-021-02301-0zbMath1470.05093arXiv1909.06698OpenAlexW3141229462MaRDI QIDQ2045395
Jesús Leaños, Christophe Ndjatchi
Publication date: 12 August 2021
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.06698
Related Items
On the Connectivity of Token Graphs of Trees ⋮ Automorphism group of 2-token graph of the Hamming graph ⋮ The automorphisms of 2-token graphs
Cites Work
- Unnamed Item
- Spectra of symmetric powers of graphs and the Weisfeiler-Lehman refinements
- On the complexity of reconfiguration problems
- Some new distance-4 constant weight codes
- Symmetric squares of graphs
- The \((n^ 2-1)\)-puzzle and related relocation problems
- The Johnson graph \(J(d,r)\) is unique if \((d,r)\neq (2,8)\)
- A linear-time algorithm for the feasibility of pebble motion on trees
- The packing number of the double vertex graph of the path graph
- On the chromatic number, colorings, and codes of the Johnson graph
- Token graphs
- Swapping labeled tokens on graphs
- A generalisation of Johnson graphs with an application to triple factorisations
- Regularity and planarity of token graphs
- Non-isomorphic graphs with cospectral symmetric powers
- The connectivity of token graphs
- The complexity of change
- Cohen-Macaulayness of triangular graphs
- Computing spectral bounds of the Heisenberg ferromagnet from geometric considerations
- Reconfigurations in Graphs and Grids
