46 citations · 163 across the 13 of their papers we have counts for
7 papers · 1 filter
Consensus in Self-similar Hierarchical Graphs and Sierpiński Graphs: Convergence Speed, Delay Robustness, and Coherence
Yi Qi, Zhongzhi Zhang, Yuhao Yi +1
The hierarchical graphs and Sierpiński graphs are constructed iteratively, which have the same number of vertices and edges at any iteration, but exhibit quite different structural…
Extended corona product as an exactly tractable model for weighted heterogeneous networks
Yi Qi, Huan Li, Zhongzhi Zhang
Various graph products and operations have been widely used to construct complex networks with common properties of real-life systems. However, current works mainly focus on design…
Maximum matchings and minimum dominating sets in Apollonian networks and extended Tower of Hanoi graphs
Yujia Jin, Huan Li, Zhongzhi Zhang
The Apollonian networks display the remarkable power-law and small-world properties as observed in most realistic networked systems. Their dual graphs are extended Tower of Hanoi g…
Kirchhoff Index As a Measure of Edge Centrality in Weighted Networks: Nearly Linear Time Algorithms
Huan Li, Zhongzhi Zhang
Most previous work of centralities focuses on metrics of vertex importance and methods for identifying powerful vertices, while related work for edges is much lesser, especially fo…
Effects of reciprocity on random walks in weighted networks
Zhongzhi Zhang, Huan Li, Yibin Sheng
It has been recently reported that the reciprocity of real-life weighted networks is very pronounced, however its impact on dynamical processes is poorly understood. In this paper,…
Maximum matchings in scale-free networks with identical degree distribution
Huan Li, Zhongzhi Zhang
The size and number of maximum matchings in a network have found a large variety of applications in many fields. As a ubiquitous property of diverse real systems, power-law degree…
Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph
Liren Shan, Huan Li, Zhongzhi Zhang
The minimum dominating set (MDS) problem is a fundamental subject of theoretical computer science, and has found vast applications in different areas, including sensor networks, pr…