The (E)FTSM-(edge) Connectivity of Cayley Graphs Generated by Transposition Trees-Reference-Cited by-同舟云学术

The (E)FTSM-(edge) Connectivity of Cayley Graphs Generated by Transposition Trees

Published:2021-10-14 Issue:01 Volume:33 Page:33-43
ISSN:0129-0541
Container-title:International Journal of Foundations of Computer Science
language:en
Short-container-title:Int. J. Found. Comput. Sci.

Author:

Li Pingshan¹^ORCID,Liu Rong²,Liu Xianglin³

Affiliation:

1. Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education, School of Mathematics and Computational Science, Xiangtan University, Xiangtan, Hunan 411105, P. R. China

2. School of Mathematics and Computational Science, Xiangtan University, Xiangtan, Hunan 411105, P. R. China

3. Xingjian College of Science and Liberal Arts, Guangxi University, Nanning, Guangxi 530004, P. R. China

Abstract

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.

Funder

Education Department of Hunan Province

Publisher

World Scientific Pub Co Pte Ltd

Subject

Computer Science (miscellaneous)

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0129054121500349

Reference30 articles.

1. A group-theoretic model for symmetric interconnection networks

2. Hyper hamiltonian laceability of Cayley graphs generated by transpositions

3. Fault-tolerant maximal local-connectivity on Bubble-sort star graphs

4. Maximally local connectivity and connected components of augmented cubes

5. Linearly many faults in Cayley graphs generated by transposition trees

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Reliability analyses of regular graphs based on edge-structure connectivity;Discrete Applied Mathematics;2024-10

2. Strong Menger Connectivity of Folded Hypercubes with Faulty Subcube;International Journal of Foundations of Computer Science;2022-11-22

3. Fault-Tolerant Strong Menger (Edge) Connectivity of DCC Linear Congruential Graphs;International Journal of Foundations of Computer Science;2022-05-28