Communication performance and vertex-transitivity on folded locally twisted cube

Abstract

ABSTRACT The communication performance and symmetry properties are two vital properties for a multiprocessor interconnection network. Diameter is an important factor to determine the communication performance of a graph. In a vertex-transitive graph, every vertex is identical to every other vertex in relation to its location. In this paper, we study the communication performance and vertex-transitivity property of the folded locally twisted cube . We find that the diameter of is , which is less than the diameter proposed by Peng [S. Peng, C. Guo, B. Yang, Topological properties of folded locally twisted cubes, Journal of Computational Information Systems, 11 (2015) 7667–7676]. And we prove that is vertex-transitive for n = 2, and is not vertex-transitive for .