Now showing items 1-9 of 9

  • On the spectra of Markov matrices for weighted Sierpinski graphs 

    Comellas Padró, Francesc de Paula; Xie, Pinchen; Zhang, Zhongzhi (2016)
    Conference report
    Open Access
    Relevant information from networked systems can be obtained by analyzing the spectra of matrices associated to their graph representations. In particular, the eigenvalues and eigenvectors of the Markov matrix and related ...
  • On the spectrum of the normalized Laplacian of iterated triangulations of graphs 

    Xie, Pinchen; Zhang, Zhongzhi; Comellas Padró, Francesc de Paula (2016-01-15)
    Article
    Open Access
    The eigenvalues of the normalized Laplacian of a graph provide information on its topological and structural characteristics and also on some relevant dynamical aspects, specifically in relation to random walks. In this ...
  • Planar unclustered graphs to model technological and biological networks 

    Miralles de la Asunción, Alicia; Chen, Lichao; Zhang, Zhongzhi; Comellas Padró, Francesc de Paula (2009-02-25)
    Article
    Open Access
    Many real life networks present an average path length logarithmic with the number of nodes and a degree distribution which follows a power law. Often these networks have also a modular and self-similar structure and, in ...
  • 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 (2010-03-01)
    Article
    Restricted access - publisher's policy
    Many real life networks present an average path length logarithmic with the number of nodes and a degree distribution which follows a power law. Often these networks have also a modular and self-similar structure and, ...
  • Self-similar non-clustered planar graphs as models for complex networks 

    Comellas Padró, Francesc de Paula; Zhang, Zhongzhi; Chen, Lichao (2008-10-10)
    Article
    Open Access
    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 ...
  • The normalized Laplacian spectrum of subdivisions of a graph 

    Xie, Pinchen; Zhang, Zhongzhi; Comellas Padró, Francesc de Paula (2016-08-05)
    Article
    Restricted access - publisher's policy
    Determining and analyzing the spectra of graphs is an important and exciting research topic in mathematics science and theoretical computer science. The eigenvalues of the normalized Laplacian of a graph provide information ...
  • The number and degree distribution of spanning trees in the Tower of Hanoi graph 

    Zhang, Zhongzhi; Wu, Shunqi; Li, Mingyun; Comellas Padró, Francesc de Paula (2016-01-04)
    Article
    Restricted access - publisher's policy
    The number of spanning trees of a graph is an important invariant related to topological and dynamic properties of the graph, such as its reliability, communication aspects, synchronization, and so on. However, the practical ...
  • The number of spanning trees in Apollonian networks 

    Zhang, Zhongzhi; Wu, Bin; Comellas Padró, Francesc de Paula (2014-05-31)
    Article
    Open Access
    In this paper we find an exact analytical expression for the number of spanning trees in Apollonian networks. This parameter can be related to significant topological and dynamic properties of the networks, including ...
  • Vertex labeling and routing in expanded Apollonian networks 

    Zhang, Zhongzhi; Comellas Padró, Francesc de Paula; Fertin, Guillaume; Raspaud, André; Rong, Lili; Zhou, Shuigeng (2007-07)
    Article
    Open Access
    We present a family of networks, expanded deterministic Apollonian networks, which are a generalization of the Apollonian networks and are simultaneously scale-free, small-world, and highly clustered. We introduce a ...