Cayley graphs as models of deterministic small-world networks
From MaRDI portal
Publication:1045911
DOI10.1016/j.ipl.2005.10.001zbMath1184.68060OpenAlexW2141872317MaRDI QIDQ1045911
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
Cayley graphinterconnection networkclustering coefficientaverage internode distancelow-diameter network
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)
Related Items
The adjacency matrix of a graph as a data table: a geometric perspective, A new small-world network created by cellular automata, Psu: a novel low-latency constant-degree overlay network, Deterministic scale-free small-world networks of arbitrary order, Echo: a peer-to-peer clustering framework for improving communication in DHTs, On necessary conditions for scale-freedom in complex networks, with applications to computer communication systems, An algorithm for finding minimal generating sets of finite groups, Structure properties of Koch networks based on networks dynamical systems, Distance-balanced graphs: symmetry conditions
Cites Work
