Modeling complex networks with self-similar outerplanar unclustered graphs
This paper introduces a family of modular, self-similar, small-world graphs with clustering zero. Relevant properties of this family are comparable to those of some networks associated with technological systems with a low clustering, like the power grid or some electronic circuits. Moreover, the gr...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2009 |
| País: | España |
| Institución: | 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/2593 |
| Acceso en línea: | https://hdl.handle.net/2117/2593 |
| Access Level: | acceso abierto |
| Palabra clave: | Combinatorics complex networks self-similar graphs modular graphs outerplanar graphs Combinacions (Matemàtica) Circuits Anàlisi de xarxes (Planificació) Classificació AMS::05 Combinatorics Classificació AMS::94 Information And Communication, Circuits::94C Circuits, networks Àrees temàtiques de la UPC::Matemàtiques i estadística |
| Sumario: | This paper introduces a family of modular, self-similar, small-world graphs with clustering zero. Relevant properties of this family are comparable to those of some networks associated with technological systems with a low clustering, like the power grid or some electronic circuits. Moreover, the graphs are outerplanar and it is know that many algorithms that are NP-complete for general graphs perform polynomial in outerplanar graphs. Therefore the graphs constitute a good mathematical model for these systems. |
|---|