“…According to the definition, the number of vertices of T n m is n+m m , and the minimum degree of T n m is n. The special cases of T n m are the following. T d 1 is K d+1 ; T 1 m is a path with m + 1 vertices; T 2 m is the triangular mesh network T m , and is also named as triangulated triangle with side length m in [8]; T 3 m is the triangular pyramid T P m which is studied in [13,14]. Since T 1 m is a path, its connectivity is 1.…”