105 citations · 793 across the 19 of their papers we have counts for
19 papers
The number and degree distribution of spanning trees in the Tower of Hanoi graph
Zhongzhi Zhang, Shunqi Wu, Mingyun Li +1
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, synchr…
The normalized Laplacian spectrum of subdivisions of a graph
Pinchen Xie, Zhongzhi Zhang, Francesc Comellas
Determining and analyzing the spectra of graphs is an important and exciting research topic in theoretical computer science. The eigenvalues of the normalized Laplacian of a graph…
On the spectrum of the normalized Laplacian of iterated triangulations of graphs
Pinchen Xie, Zhongzhi Zhang, Francesc Comellas
The eigenvalues of the normalized Laplacian of a graph provide information on its topological and structural characteristics and also on some relevant dynamical aspects, specifical…
Deterministic hierarchical networks
L. Barrière, F. Comellas, C. Dalfó +1
It has been shown that many networks associated with complex systems are small-world (they have both a large local clustering coefficient and a small diameter) and they are also sc…
Quantum Google in a Complex Network
G. D. Paparo, M. Mueller, F. Comellas +1
We investigate the behavior of the recently proposed quantum Google algorithm, or quantum PageRank, in large complex networks. Applying the quantum algorithm to a part of the real…
The Number of Spanning Trees of an Infinite Family of Outerplanar, Small-World and Self-Similar Graphs
Francesc Comellas, Alicia Miralles, Hongxiao Liu +1
In this paper we give an exact analytical expression for the number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs. This number is an i…