Self-similar non-clustered planar graphs as models for complex networks
In this paper we introduce a family of planar, modular and self-similar graphs which have small-world and scale-free properties. The main parameters of this family are comparable to those of networks associated with complex systems, and therefore the graphs are of interest as mathematical models for...
| Autores: | , , |
|---|---|
| Formato: | artículo |
| Fecha de publicación: | 2008 |
| País: | España |
| Recursos: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/2451 |
| Acesso em linha: | https://hdl.handle.net/2117/2451 |
| Access Level: | acceso abierto |
| Palavra-chave: | Combinatorics Computer science Complex Networks Self-similar Graphs Modular Networks Combinacions (Matemàtica) Informàtica--Matemàtica Classificació AMS::05 Combinatorics Classificació AMS::68 Computer science::68R Discrete mathematics in relation to computer science |
| Resumo: | In this paper we introduce a family of planar, modular and self-similar graphs which have small-world and scale-free properties. The main parameters of this family are comparable to those of networks associated with complex systems, and therefore the graphs are of interest as mathematical models for these systems. As the clustering coefficient of the graphs is zero, this family % of graphs is an explicit construction that does not match the usual characterization of hierarchical modular networks, namely that vertices have clustering values inversely proportional to their degrees. |
|---|