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

DOI10.1137/06067434XMaRDI QIDQ3563935zbMATH OpenFDO

Authors Sanming Zhou

Publication date 1 June 2010

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

Full work available at URL https://doi.org/10.1137/06067434X

zbMATH Keywords

Cayley graphinterconnection networkarc-transitive graphFrobenius groupgossipingedge-forwarding indexFrobenius grapharc-forwarding indexcommunication algorithmcomplete rotationminimum gossip timeorbital-regular graphs

Mathematics Subject Classification ID

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

Recommendations

• Two families of Cayley graph interconnection networks
• Theory and Applications of Models of Computation
• New methods for using Cayley graphs in interconnection networks
• Some mathematical properties of cayley digraphs with applications to interconnection network design
• Trivalent Cayley graphs for interconnection networks
• Structural properties of Cayley digraphs with applications to mesh and pruned torus interconnection networks
• scientific article; zbMATH DE number 1054728
• Network models in class \(C\) on arbitrary graphs
• Processor interconnection networks from Cayley graphs
• Arc-transitive trivalent Cayley graphs

Cited in

(25)

• Theory and Applications of Models of Computation
• On the regular digraph of ideals of commutative rings
• A class of hierarchical graphs as topologies for interconnection networks
• The automorphism group of the alternating group graph
• Gossiping and routing in second-kind Frobenius graphs
• Eigenvalues of Cayley graphs
• Trivalent Cayley graphs for interconnection networks
• Deterministic walks with choice
• Rotational circulant graphs
• New methods for using Cayley graphs in interconnection networks
• Processor interconnection networks from Cayley graphs
• Rotational Cayley graphs on transposition generated groups
• Frobenius circulant graphs of valency six, Eisenstein-Jacobi networks, and hexagonal meshes
• Tree connectivities of Cayley graphs on abelian groups with small degrees
• Cube-connected circulants: bisection width, Wiener and forwarding indices
• Zero divisor graph of a lattice with respect to an ideal
• Gossiping and routing in undirected triple-loop networks
• Unit graphs of rings of polynomials and power series
• Cyclotomic graphs and perfect codes
• Linear k-arboricity of Caylay graphs on abelian groups with given degree
• On two generalized connectivities of graphs
• Resolvable Mendelsohn designs and finite Frobenius groups
• Recursive cubes of rings as models for interconnection networks
• The regular digraph associated to a poset
• Some mathematical properties of cayley digraphs with applications to interconnection network design

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3563935)