Zhiqiang Wu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Zhiqiang Wu has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Cheng Zeng
School of Mathematics and Information Science, Shandong Technology and Business University, Yantai 264003, P. R. China
4 shared publications - Yumei Xue
School of Mathematical Science, Beihang University, Beijing 100191, P. R. China
4 shared publications - Huixia He
School of Mathematical Sciences, Beihang University, Beijing 100083, P. R. China
2 shared publications - Wenjie Wang
School of Mathematical Sciences, Beihang University, Beijing 100083, P. R. China
2 shared publications - Zixuan Zhao
School of Mathematical Sciences, Beihang University, Beijing 100083, P. R. China
2 shared publications Daohua Wang
Graduate School of Systems and Information Engineering, University of Tsukuba, Tennodai 1-1-1, Tsukuba, 305-8573, Japan
1 shared publication
Latest Publications
- 1 January 2025
- Published by World Scientific Pub Co Pte Ltd in Fractals
- Vol. 33 (07)
CONSENSUS DYNAMICS WITH LEADER SELECTION IN HEXAGONAL NETWORKS
This study investigates the noise consensus dynamics in a class of networks with an initial hexagonal structure, where the vertices are subjected to white noise. Leveraging the network’s self-similarity, a comprehensive spectral analysis is conducted. The research further explores the first- and second-order coherence in networks without leader nodes, as well as the first- and second-order coherence in networks with a single leader node and the first-order coherence in networks with dual leader nodes. Based on the specific topological properties of the network, explicit formulas for coherence under each consensus algorithm are derived. Taking UAV swarms as a representative example, the implications of the findings for leader node selection in multi-agent systems are analyzed, providing valuable theoretical insights into optimizing network performance.
- 1 January 2025
- Published by World Scientific Pub Co Pte Ltd in Fractals
- Vol. 33 (07)
CONSENSUS DYNAMICS WITH LEADER SELECTION IN HEXAGONAL NETWORKS
This study investigates the noise consensus dynamics in a class of networks with an initial hexagonal structure, where the vertices are subjected to white noise. Leveraging the network’s self-similarity, a comprehensive spectral analysis is conducted. The research further explores the first- and second-order coherence in networks without leader nodes, as well as the first- and second-order coherence in networks with a single leader node and the first-order coherence in networks with dual leader nodes. Based on the specific topological properties of the network, explicit formulas for coherence under each consensus algorithm are derived. Taking UAV swarms as a representative example, the implications of the findings for leader node selection in multi-agent systems are analyzed, providing valuable theoretical insights into optimizing network performance.
- 1 January 2024
- Published by World Scientific Pub Co Pte Ltd in Fractals
- Vol. 32 (03)
SOME ZAGREB-TYPE INDICES OF VICSEK POLYGON GRAPHS
Chemical graph theory plays an essential role in modeling and designing any chemical structure or chemical network. For a (molecular) graph, the Zagreb indices and the Zagreb eccentricity indices are well-known topological indices to describe the structure of a molecule or graph and can be used to predict properties such as the size and number of rings in a molecule, as well as the thermodynamic stability and reactivity of compounds. In this paper, we introduce a class of molecular models, namely, the Vicsek polygon graphs, which extend the traditional Vicsek networks. We compute the Zagreb indices and the Zagreb eccentricity indices of Vicsek polygon graphs by self-similarity and the recurrence relation based on the construction of graphs.
- 1 January 2024
- Published by World Scientific Pub Co Pte Ltd in Fractals
- Vol. 32 (03)
SOME ZAGREB-TYPE INDICES OF VICSEK POLYGON GRAPHS
Chemical graph theory plays an essential role in modeling and designing any chemical structure or chemical network. For a (molecular) graph, the Zagreb indices and the Zagreb eccentricity indices are well-known topological indices to describe the structure of a molecule or graph and can be used to predict properties such as the size and number of rings in a molecule, as well as the thermodynamic stability and reactivity of compounds. In this paper, we introduce a class of molecular models, namely, the Vicsek polygon graphs, which extend the traditional Vicsek networks. We compute the Zagreb indices and the Zagreb eccentricity indices of Vicsek polygon graphs by self-similarity and the recurrence relation based on the construction of graphs.
- 25 January 2023
- Published by Elsevier in Chaos, Solitons & Fractals
- Vol. 168, 113149
Kirchhoff index of a class of polygon networks
- 25 January 2023
- Published by Elsevier in Chaos, Solitons & Fractals
- Vol. 168, 113149
Kirchhoff index of a class of polygon networks
- 1 January 2023
- Published by World Scientific Pub Co Pte Ltd in Fractals
- Vol. 31 (09)
AVERAGE FERMAT DISTANCE ON VICSEK POLYGON NETWORK
The Fermat problem is a crucial topological issue corresponding to fractal networks. In this paper, we discuss the average Fermat distance (AFD) of the Vicsek polygon network and analyze structural properties. We construct the Vicsek polygon network based on Vicsek fractal in an iterative way. Given the structure of network, we present an elaborate analysis of the Fermat point under various situations. The special network structure allows a way to calculate the AFD based on average geodesic distance (AGD). Moreover, we introduce the Vicsek polygon fractal and calculate its AGD and AFD. Its relationship with the network enables us to deduce the above two indices of the network directly. The results show that both in network and fractal, the ratio of AFD and AGD tends to 3/2, which demonstrates that both of them can serve as indicators of small-world property of complex networks. In fact, in Vicsek polygon network, the AFD grows linearly with network order, implying that our evolving network does not possess the small-world property.
- 1 January 2023
- Published by World Scientific Pub Co Pte Ltd in Fractals
- Vol. 31 (09)
AVERAGE FERMAT DISTANCE ON VICSEK POLYGON NETWORK
The Fermat problem is a crucial topological issue corresponding to fractal networks. In this paper, we discuss the average Fermat distance (AFD) of the Vicsek polygon network and analyze structural properties. We construct the Vicsek polygon network based on Vicsek fractal in an iterative way. Given the structure of network, we present an elaborate analysis of the Fermat point under various situations. The special network structure allows a way to calculate the AFD based on average geodesic distance (AGD). Moreover, we introduce the Vicsek polygon fractal and calculate its AGD and AFD. Its relationship with the network enables us to deduce the above two indices of the network directly. The results show that both in network and fractal, the ratio of AFD and AGD tends to 3/2, which demonstrates that both of them can serve as indicators of small-world property of complex networks. In fact, in Vicsek polygon network, the AFD grows linearly with network order, implying that our evolving network does not possess the small-world property.