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...
שמור ב:
| Principais autores: | , , |
|---|---|
| פורמט: | Artigo |
| שפה: | Inglês |
| יצא לאור: |
Discrete Mathematics & Theoretical Computer Science
2022-03-01
|
| סדרה: | Discrete Mathematics & Theoretical Computer Science |
| נושאים: | |
| גישה מקוונת: | https://dmtcs.episciences.org/7538/pdf |
| תגים: |
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|