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

DOI10.1088/1751-8113/42/42/425001zbMath1180.90032OpenAlexW2092926483MaRDI QIDQ3654248

Alicia Miralles, Francesc Comellas

Publication date: 5 January 2010

Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2117/3048

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (5)

The number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs ⋮ Comparing classical and quantum pageranks ⋮ The Tutte polynomial of a class of compound graphs and its applications ⋮ Structure properties of Koch networks based on networks dynamical systems ⋮ Vertex labeling and routing for Farey-type symmetrically-structured graphs

This page was built for publication: Vertex labeling and routing in self-similar outerplanar unclustered graphs modeling complex networks