共 50 条
On the Connectivity of Token Graphs of Trees
被引:0
|作者:
Fabila-Monroy, Ruy
[1
]
Leanos, Jesus
[2
]
Laura Trujillo-Negrete, Ana
[1
]
机构:
[1] CINVESTAV, Dept Matemat, Cdmx, Mexico
[2] Univ Autonoma Zacatecas, Unidad Acad Matemat, Zacatecas, Zacatecas, Mexico
来源:
关键词:
token graphs;
connectivity;
trees;
D O I:
10.46298/dmtcs.7538
中图分类号:
TP31 [计算机软件];
学科分类号:
081202 ;
0835 ;
摘要:
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 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).
引用
收藏
页数:23
相关论文