Transposition networks as a class of fault-tolerant robust networks

DOI10.1109/12.485375zbMath1048.68522OpenAlexW2155781858MaRDI QIDQ4420900

Shahram Latifi, Pradip K. Srimani

Publication date: 1996

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/2de8e3842c1c6d25aca734e8e96bd70bcc6d8bc1

zbMATH Keywords

Cayley graphstar graphbubble-sort graph

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items

VLSI layouts of complete graphs and star graphs ⋮ Distance distribution of nodes in star graphs ⋮ Data center interconnection networks are not hyperbolic ⋮ Edge-transitivity of Cayley graphs generated by transpositions ⋮ The number of shortest paths in the (n, k)-star graph ⋮ A kind of conditional connectivity of transposition networks generated by \(k\)-trees ⋮ The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks ⋮ A kind of conditional connectivity of Cayley graphs generated by wheel graphs ⋮ The number of shortest paths in the arrangement graph ⋮ Reliability analysis of Cayley graphs generated by transpositions ⋮ Some conditional vertex connectivities of complete-transposition graphs ⋮ Polynomial time algorithm for constructing vertex-disjoint paths in transposition graphs ⋮ On the energy of transposition graphs