Label-based routing for a family of scale-free, modular, planar and unclustered graphs

DOI10.1088/1751-8113/44/20/205102zbMath1226.05212OpenAlexW2027938620WikidataQ57772696 ScholiaQ57772696MaRDI QIDQ3004925

Francesc Comellas, Alicia Miralles

Publication date: 6 June 2011

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

Full work available at URL: https://doi.org/10.1088/1751-8113/44/20/205102

zbMATH Keywords

planar graphslabel-based routingunclustered graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (5)

A class of vertex-edge-growth small-world network models having scale-free, self-similar and hierarchical characters ⋮ Invulnerability of planar two-tree networks ⋮ Structure properties of Koch networks based on networks dynamical systems ⋮ Enumeration of spanning trees in planar unclustered networks ⋮ Vertex labeling and routing for Farey-type symmetrically-structured graphs

This page was built for publication: Label-based routing for a family of scale-free, modular, planar and unclustered graphs