Edge-transitive token graphs

Zhang, Ju; Zhou, Jin‐Xin

doi:10.1016/j.disc.2022.113043

Search citation statements

Order By: Relevance

Paper Sections

Select...

It Is Known That1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2022

2024

Publication Types

Select...

Article3

Relationship

Self Cite0

Independent3

Authors

Journals

Cited by 3 publications

(1 citation statement)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The particular cases of F2(Kn,n), F k (K1,n) and F (n+2)/2 (K2,n) in Theorem 1, were proven recently in [ZZ22]. Let X be a set, and let 2 X be the set of all subsets of X.…”

Section: It Is Known Thatmentioning

confidence: 98%

On the Connectivity of Token Graphs of Trees

Fabila-Monroy¹,

Leaños²,

Trujillo-Negrete³

2022

Discrete Mathematics &Amp; Theoretical Computer Science

View full text Add to dashboard Cite

Let $k$ and $n$ be integers such that $1\leq k \leq n-1$, and let $G$ be a simple graph of order $n$. The $k$-token graph $F_k(G)$ of $G$ is the graph whose vertices are the $k$-subsets of $V(G)$, where two vertices are adjacent in $F_k(G)$ whenever their symmetric difference is an edge of $G$. In this paper we show that if $G$ is a tree, then the connectivity of $F_k(G)$ is equal to the minimum degree of $F_k(G)$.

show abstract

“…The particular cases of F2(Kn,n), F k (K1,n) and F (n+2)/2 (K2,n) in Theorem 1, were proven recently in [ZZ22]. Let X be a set, and let 2 X be the set of all subsets of X.…”

Section: It Is Known Thatmentioning

confidence: 98%