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...
محفوظ في:
| المؤلفون الرئيسيون: | , , |
|---|---|
| التنسيق: | Artigo |
| اللغة: | Inglês |
| منشور في: |
Discrete Mathematics & Theoretical Computer Science
2022-03-01
|
| سلاسل: | Discrete Mathematics & Theoretical Computer Science |
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://dmtcs.episciences.org/7538/pdf |
| الوسوم: |
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|