Topological properties on the diameters of the integer simplex

Wide diameter $d_\omega(G)$ and fault-diameter $D_\omega(G)$ of an interconnection network $G$ have been recently studied by many authors. We determine the wide diameter and fault-diameter of the integer simplex $T_m^n$. Note that $d_1(T_m^n)=D_1(T_m^n)= d(T_m^n)$, where $d(T_m^n)$ is the diameter of $T_m^n$. We prove that $d_\omega(T_m^n)=D_\omega(T_m^n)= d(T_m^n)+1$ when $2\leq\omega\leq n$. Since a triangular pyramid $TP_L$ is $T_L^3$, we have $d_\omega(TP_L)=D_\omega(TP_L)= d(TP_L)+1$ when $2\leq\omega\leq 3$.

[1]  Hamid Sarbazi-Azad,et al.  The triangular pyramid: Routing and topological properties , 2010, Inf. Sci..

[2]  Janez vZerovnik,et al.  Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles , 2012 .

[3]  Janez Zerovnik,et al.  The fault-diameter of Cartesian products , 2008, Adv. Appl. Math..

[4]  Janez Zerovnik,et al.  Wide diameter of Cartesian graph bundles , 2010, Discret. Math..

[5]  TZU-LIANG KUNG,et al.  Fault Diameter of Hypercubes with Hybrid Node and Link Faults , 2009, J. Interconnect. Networks.

[6]  Benjamin Kraft,et al.  Diameters of Cayley graphs generated by transposition trees , 2015, Discret. Appl. Math..

[7]  M. Krishnamoorthy,et al.  Fault diameter of interconnection networks , 1987 .

[8]  Chien-Ping Chang,et al.  Conditional fault diameter of crossed cubes , 2009, J. Parallel Distributed Comput..

[9]  Xie-Bin Chen,et al.  Edge-fault-tolerant diameter and bipanconnectivity of hypercubes , 2010, Inf. Process. Lett..

[10]  Min Xu,et al.  Fault diameter of Cartesian product graphs , 2005, Inf. Process. Lett..

[11]  Rija Erves,et al.  Mixed fault diameter of Cartesian graph bundles , 2013, Discret. Appl. Math..

[12]  Michael E. Saks,et al.  On the bandwidth of triangulated triangles , 1995, Discret. Math..

[13]  Junming Xu Topological Structure and Analysis of Interconnection Networks , 2002, Network Theory and Applications.

[14]  Jian-Hua Yin,et al.  On the fault-tolerant diameter and wide diameter of ω-connected graphs , 2005 .

[15]  D. Frank Hsu,et al.  Fault-tolerant routing in circulant networks and cycle prefix networks , 1998 .

[16]  Mei Lu,et al.  Fault-tolerant diameter for three family interconnection networks , 2012, J. Comb. Optim..

[17]  Ping Wang,et al.  Some new topological properties of the triangular pyramid networks , 2013, Inf. Sci..

[18]  Janez Žerovnik,et al.  The edge fault-diameter of Cartesian graph bundles , 2009, Eur. J. Comb..