Modeling complex networks with self-similar outerplanar unclustered graphs

All of RECERCAT

To access the full text documents, please follow this link: http://hdl.handle.net/2117/2593

Title:	Modeling complex networks with self-similar outerplanar unclustered graphs
Author:	Comellas Padró, Francesc de Paula; Miralles de la Asunción, Alicia
Other authors:	Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV; Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
Abstract:	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.
Subject(s):	-Àrees temàtiques de la UPC::Matemàtiques i estadística -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
Rights:	Attribution-NonCommercial-NoDerivs 3.0 Spain http://creativecommons.org/licenses/by-nc-nd/3.0/es/
Document type:	Article
Share: