The (E)FTSM-(edge) Connectivity of Cayley Graphs Generated by Transposition Trees
2021 ◽
pp. 1-11
Keyword(s):
The Cayley graph generated by a transposition tree [Formula: see text] is a class of Cayley graphs that contains the star graph and the bubble sort graph. A graph [Formula: see text] is called strongly Menger (SM for short) (edge) connected if each pair of vertices [Formula: see text] are connected by [Formula: see text] (edge)-disjoint paths, where [Formula: see text] are the degree of [Formula: see text] and [Formula: see text] respectively. In this paper, the maximally edge-fault-tolerant and the maximally vertex-fault-tolerant of [Formula: see text] with respect to the SM-property are found and thus generalize or improve the results in [19, 20, 22, 26] on this topic.
2009 ◽
Vol 10
(03)
◽
pp. 253-260
◽
Keyword(s):
2019 ◽
Vol 30
(08)
◽
pp. 1301-1315
◽
Keyword(s):
1994 ◽
Vol 04
(02)
◽
pp. 191-222
Keyword(s):
2003 ◽
Vol 40
(1-2)
◽
pp. 151-158
Keyword(s):