Self-similar non-clustered planar graphs as models for complex networks

All of RECERCAT

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

Title:	Self-similar non-clustered planar graphs as models for complex networks
Author:	Comellas Padró, Francesc de Paula; Zhang, Zhongzhi; Chen, Lichao
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:	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.
Abstract:	Peer Reviewed
Subject(s):	-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
Rights:	Attribution-NonCommercial-NoDerivs 3.0 Spain http://creativecommons.org/licenses/by-nc-nd/3.0/es/
Document type:	Article
Share: