A Class of Arc-Transitive Cayley Graphs as Models for Interconnection Networks

DOI10.1137/06067434XzbMath1191.05056MaRDI QIDQ3563935

Sanming Zhou

Publication date: 1 June 2010

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Cayley graphcomplete rotationgossipingFrobenius groupinterconnection networkarc-transitive graphedge-forwarding indexFrobenius grapharc-forwarding indexcommunication algorithmminimum gossip timeorbital-regular graphs

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Related Items (19)

Cyclotomic graphs and perfect codes ⋮ Eigenvalues of Cayley graphs ⋮ Frobenius circulant graphs of valency six, Eisenstein-Jacobi networks, and hexagonal meshes ⋮ Unit graphs of rings of polynomials and power series ⋮ RESOLVABLE MENDELSOHN DESIGNS AND FINITE FROBENIUS GROUPS ⋮ The automorphism group of the alternating group graph ⋮ The regular digraph associated to a poset ⋮ On two generalized connectivities of graphs ⋮ Gossiping and routing in second-kind Frobenius graphs ⋮ Tree connectivities of Cayley graphs on abelian groups with small degrees ⋮ Recursive cubes of rings as models for interconnection networks ⋮ Zero divisor graph of a lattice with respect to an ideal ⋮ A class of hierarchical graphs as topologies for interconnection networks ⋮ Gossiping and routing in undirected triple-loop networks ⋮ Cube-connected circulants: bisection width, Wiener and forwarding indices ⋮ Deterministic walks with choice ⋮ Rotational circulant graphs ⋮ Linear \(k\)-arboricity of Caylay graphs on abelian groups with given degree ⋮ ON THE REGULAR DIGRAPH OF IDEALS OF COMMUTATIVE RINGS

This page was built for publication: A Class of Arc-Transitive Cayley Graphs as Models for Interconnection Networks