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

Inicio | ¿Qué es? | Contacto

English | Català

Consultar RECERCAT

Por comunidades y
colecciones Por fecha Por autores Por títulos Por temas (CDU)

Consultar departamento

Por fecha Por autores Por títulos Por temas (CDU)

Estadisticas

Del documento Todo RECERCAT

Mi RECERCAT

Entrar Alertas por correo-e

Directorio de otros repositorios

RECERCAT Principal > Universitat Politècnica de Catalunya > Documents de recerca > Visualizar documento

Para acceder a los documentos con el texto completo, por favor, siga el siguiente enlace: http://hdl.handle.net/2117/2451

dc.contributor	Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV
dc.contributor	Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
dc.contributor.author	Comellas Padró, Francesc de Paula
dc.contributor.author	Zhang, Zhongzhi
dc.contributor.author	Chen, Lichao
dc.date	2008-10-10
dc.identifier.uri	http://hdl.handle.net/2117/2451
dc.language.iso	eng
dc.relation	TEC2005-03575
dc.rights	Attribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights	info:eu-repo/semantics/openAccess
dc.rights	http://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subject	Combinatorics
dc.subject	Computer science
dc.subject	Complex Networks
dc.subject	Self-similar Graphs
dc.subject	Modular Networks
dc.subject	Combinacions (Matemàtica)
dc.subject	Informàtica--Matemàtica
dc.subject	Classificació AMS::05 Combinatorics
dc.subject	Classificació AMS::68 Computer science::68R Discrete mathematics in relation to computer science
dc.title	Self-similar non-clustered planar graphs as models for complex networks
dc.type	info:eu-repo/semantics/article
dc.description.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.
dc.description.abstract	Peer Reviewed

Mostrar el registro sencillo del ítem

Documentos relacionados

Otros documentos del mismo autor/a

Planar unclustered scale-free graphs as models for technological and biological networks

Miralles de la Asunción, Alicia; Comellas Padró, Francesc de Paula; Chen, Lichao; Zhang, Zhongzhi

Planar unclustered graphs to model technological and biological networks

Miralles de la Asunción, Alicia; Chen, Lichao; Zhang, Zhongzhi; Comellas Padró, Francesc de Paula

On the spectrum of the normalized Laplacian of iterated triangulations of graphs

Xie, Pinchen; Zhang, Zhongzhi; Comellas Padró, Francesc de Paula

The normalized Laplacian spectrum of subdivisions of a graph

Xie, Pinchen; Zhang, Zhongzhi; Comellas Padró, Francesc de Paula

The number of spanning trees in Apollonian networks

Zhang, Zhongzhi; Wu, Bin; Comellas Padró, Francesc de Paula

Accesibilidad | Aviso legal | Política de Cookies | Documentos de uso interno

Coordinación

Patrocinio