Gossiping and routing in undirected triple-loop networks

DOI10.1002/net.20327zbMath1202.90045OpenAlexW4236280100MaRDI QIDQ3057157

Alison Thomson, Sanming Zhou

Publication date: 24 November 2010

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20327

zbMATH Keywords

complete rotationgossipingroutingWiener indexcirculant graphedge-forwarding indexFrobenius graphtriple-loop network

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Deterministic network models in operations research (90B10)

Related Items (14)

Cyclotomic graphs and perfect codes ⋮ Greedy routing in circulant networks ⋮ Frobenius circulant graphs of valency six, Eisenstein-Jacobi networks, and hexagonal meshes ⋮ Unit graphs of rings of polynomials and power series ⋮ Forwarding and optical indices of 4-regular circulant networks ⋮ The regular digraph associated to a poset ⋮ Gossiping and routing in second-kind Frobenius graphs ⋮ A SET OF FAMILIES OF ANALYTICALLY DESCRIBED TRIPLE LOOP NETWORKS DEFINED BY A PARAMETER ⋮ Distance eigenvalues and forwarding indices of circulants ⋮ Recursive cubes of rings as models for interconnection networks ⋮ Unnamed Item ⋮ Zero divisor graph of a lattice with respect to an ideal ⋮ Rotational circulant graphs ⋮ A family of efficient six-regular circulants representable as a Kronecker product

Cites Work

• Unnamed Item
• Unnamed Item
• The edge-forwarding index or orbital regular graphs
• On orbital regular graphs and Frobenius graphs
• Spanning subgraphs with applications to communication of a subclass of the Cayley-graph-based networks
• On forwarding indices of networks
• Finding optimal routings in Hamming graphs
• A survey on multi-loop networks.
• A Class of Arc-Transitive Cayley Graphs as Models for Interconnection Networks
• Fault-tolerant routings in chordal ring networks
• Lower Bounds on the Broadcasting and Gossiping Time of Restricted Protocols
• FROBENIUS CIRCULANT GRAPHS OF VALENCY FOUR
• Complete rotations in Cayley graphs

This page was built for publication: Gossiping and routing in undirected triple-loop networks