Add to ORKGThis 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 clus-tering, 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. Key words: complex networks, self-similar graphs, modular graphs, outerplanar graphs. 1
International audienceThe modularity maximization model proposed by Newman and Girvan for the identi...
For over a century, modelling of physical as well as non-physicalsystems and processes has been perf...
Abstract. The number of spanning trees of a graph, also known as the complexity, is investigated for...
This paper introduces a family of modular, self-similar, small-world graphs with clustering zero. Re...
In this paper we introduce a family of planar, modular and self-similar graphs which have small-worl...
Es publicarà a Journal of Physics A: Mathematical and TheoreticalThis paper introduces a labeling an...
Many real life networks present an average path length logarithmic with the number of nodes and a de...
Many real life networks present an average path length logarithmic with the number of nodes and a de...
Received (to be inserted by publisher) Unsupervised clustering, also known as natural clustering, st...
We propose a novel mechanism to generate a family of deterministic small-world and scale-free networ...
Unsupervised clustering, also known as natural clustering, stands for the classification of data acc...
We introduce a minimal network model which generates a modular structure in a self-organized way. To...
We propose a unified model to build planar graphs with diverse topological characteristics which are...
We make a mapping from Sierpinski fractals to a new class of networks, the incompatibility networks,...
Abstract. Networks are often studied as graphs, where the vertices stand for entities in the world a...
International audienceThe modularity maximization model proposed by Newman and Girvan for the identi...
For over a century, modelling of physical as well as non-physicalsystems and processes has been perf...
Abstract. The number of spanning trees of a graph, also known as the complexity, is investigated for...
This paper introduces a family of modular, self-similar, small-world graphs with clustering zero. Re...
In this paper we introduce a family of planar, modular and self-similar graphs which have small-worl...
Es publicarà a Journal of Physics A: Mathematical and TheoreticalThis paper introduces a labeling an...
Many real life networks present an average path length logarithmic with the number of nodes and a de...
Many real life networks present an average path length logarithmic with the number of nodes and a de...
Received (to be inserted by publisher) Unsupervised clustering, also known as natural clustering, st...
We propose a novel mechanism to generate a family of deterministic small-world and scale-free networ...
Unsupervised clustering, also known as natural clustering, stands for the classification of data acc...
We introduce a minimal network model which generates a modular structure in a self-organized way. To...
We propose a unified model to build planar graphs with diverse topological characteristics which are...
We make a mapping from Sierpinski fractals to a new class of networks, the incompatibility networks,...
Abstract. Networks are often studied as graphs, where the vertices stand for entities in the world a...
International audienceThe modularity maximization model proposed by Newman and Girvan for the identi...
For over a century, modelling of physical as well as non-physicalsystems and processes has been perf...
Abstract. The number of spanning trees of a graph, also known as the complexity, is investigated for...