On the Connectivity of Token Graphs of Trees
Let k and n be integers such that 1 ≤ k ≤ n - 1, and let G be a simple graph of order n. The k-token graph Fk(G) of G is the graph whose vertices are the k-subsets of V (G), where two vertices are adjacent in Fk(G) whenever their symmetric difference is an edge of G. In this paper we show that if G...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics and Theoretical Computer Science
2022
|
| Subjects: | |
| Online Access: | View Fulltext in Publisher |