Show simple item record

dc.contributor.authorComellas Padró, Francesc de Paula
dc.contributor.authorMiralles de la Asunción, Alicia
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV
dc.description.abstractThis 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.
dc.format.extent13 p.
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Spain
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística
dc.subject.othercomplex networks
dc.subject.otherself-similar graphs
dc.subject.othermodular graphs
dc.subject.otherouterplanar graphs
dc.titleModeling complex networks with self-similar outerplanar unclustered graphs
dc.subject.lemacCombinacions (Matemàtica)
dc.subject.lemacAnàlisi de xarxes (Planificació)
dc.contributor.groupUniversitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
dc.subject.amsClassificació AMS::05 Combinatorics
dc.subject.amsClassificació AMS::94 Information And Communication, Circuits::94C Circuits, networks
dc.rights.accessOpen Access

Files in this item


This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivs 3.0 Spain
Except where otherwise noted, content on this work is licensed under a Creative Commons license : Attribution-NonCommercial-NoDerivs 3.0 Spain