On the Connectivity of Token Graphs of Trees

DOI10.46298/dmtcs.7538zbMath1515.05097arXiv2004.14526WikidataQ113199904 ScholiaQ113199904MaRDI QIDQ6045414

Ana Laura Trujillo-Negrete, Jesús Leaños, Ruy Fabila-Monroy

Publication date: 30 May 2023

Published in: Discrete Mathematics & Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

connectivitytreestoken graphs

Mathematics Subject Classification ID

Trees (05C05) Connectivity (05C40) Vertex degrees (05C07)

Related Items (1)

Spectral properties of token graphs

Cites Work

• 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 Johnson graph \(J(d,r)\) is unique if \((d,r)\neq (2,8)\)
• 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
• The edge-connectivity of 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
• Cohen-Macaulayness of triangular graphs
• Computing spectral bounds of the Heisenberg ferromagnet from geometric considerations
• Unnamed Item
• Unnamed Item

This page was built for publication: On the Connectivity of Token Graphs of Trees