Loading...
Loading...

Go to the content (press return)

Vertex labeling and routing in self-similar outerplanar unclustered graphs modeling complex networks

Author
Comellas, F.; Miralles, A.
Type of activity
Journal article
Journal
Journal of physics A. Mathematical and theoretical
Date of publication
2009-10
Volume
42
Number
42
First page
5001
DOI
https://doi.org/10.1088/1751-8113/42/42/425001 Open in new window
Repository
http://hdl.handle.net/2117/3048 Open in new window
URL
http://www.iop.org/EJ/toc/1751-8113/42/42 Open in new window
Abstract
Es publicarà a Journal of Physics A: Mathematical and Theoretical This paper introduces a labeling and optimal routing algorithm for a family of modular, self-similar, small-world graphs with clustering zero. Many properties of this family are comparable to those of networks associated with technological and biological systems with a low clustering, like the power grid, some electronic circuits and protein networks. For these systems, the existence of models with an efficient routing protocol...
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications

Participants

Attachments