On the Connectivity of Token Graphs of Trees
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 t...
Gorde:
| Egile Nagusiak: | , , |
|---|---|
| Formatua: | Artigo |
| Hizkuntza: | Inglês |
| Argitaratua: |
Discrete Mathematics & Theoretical Computer Science
2022-03-01
|
| Saila: | Discrete Mathematics & Theoretical Computer Science |
| Gaiak: | |
| Sarrera elektronikoa: | https://dmtcs.episciences.org/7538/pdf |
| Etiketak: |
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|