Cayley graphs as models of deterministic small-world networks

DOI10.1016/j.ipl.2005.10.001zbMath1184.68060MaRDI QIDQ1045911

Behrooz Parhami, Wenjun Xiao

Publication date: 18 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.10.001

zbMATH Keywords

Cayley graph; interconnection network; clustering coefficient; average internode distance; low-diameter network

Mathematics Subject Classification ID

68M10: Network design and communication in computer systems

68R10: Graph theory (including graph drawing) in computer science

Related Items

Psu: a novel low-latency constant-degree overlay network, Echo: a peer-to-peer clustering framework for improving communication in DHTs, A new small-world network created by cellular automata, Deterministic scale-free small-world networks of arbitrary order, Structure properties of Koch networks based on networks dynamical systems, The adjacency matrix of a graph as a data table: a geometric perspective, Distance-balanced graphs: symmetry conditions, On necessary conditions for scale-freedom in complex networks, with applications to computer communication systems

Cites Work

• Unnamed Item
• Tables of large graphs with given degree and diameter
• Deterministic small-world networks
• Statistical mechanics of complex networks
• Group Action Graphs and Parallel Architectures
• A group-theoretic model for symmetric interconnection networks
• Collective dynamics of ‘small-world’ networks