Haixing Zhao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Haixing Zhao has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Yaping Mao
Academy of Plateau Science and Sustainability, and School of Mathematics and Statistics, Qinghai Normal University, Xining, China
2 shared publications Chengfu Ye
Department of Mathematics, Qinghai Normal University, Xining, Qinghai 810008, PR China
1 shared publicationFeng Hu
1 shared publication- Jianfeng Wang
School of Mathematics and Statistics, Shandong University of Technology, Zibo, China
1 shared publication Liang Wei
Department of Mathematics, Qinghai Normal University, Xining, Qinghai, China
1 shared publication- Pengfeng Hou
State Key Laboratory of Integrated Service Networks, Xidian University, Xi'an, Shaanxi 710071, People's Republic of China
1 shared publication
Latest Publications
- 2 February 2016
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 49 (11) , 115101
A small-world network derived from the deterministic uniform recursive tree by line graph operation
The deterministic uniform recursive tree is one of the deterministic versions of the uniform recursive tree . Zhang et al (2008 Eur. Phys. J. B 63 507–13) studied the properties of DURT, including its topological characteristics and spectral properties. Although DURT shows a logarithmic scaling with the size of the network, DURT is not a small-world network since its clustering coefficient is zero. Lu et al (2012 Physica A 391 87–92) proposed a deterministic small-world network by adding some edges with a simple rule in each DURT iteration. In this paper, we intoduce a method for constructing a new deterministic small-world network by the line graph operation in each DURT iteration. The line graph operation brings about cliques at each node of the previous given graph, and the resulting line graph possesses larger clustering coefficients. On the other hand, this operation can decrease the diameter at almost one, then giving the analytic solutions to several topological characteristics of the model proposed.
- 2 February 2016
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 49 (11) , 115101
A small-world network derived from the deterministic uniform recursive tree by line graph operation
The deterministic uniform recursive tree is one of the deterministic versions of the uniform recursive tree . Zhang et al (2008 Eur. Phys. J. B 63 507–13) studied the properties of DURT, including its topological characteristics and spectral properties. Although DURT shows a logarithmic scaling with the size of the network, DURT is not a small-world network since its clustering coefficient is zero. Lu et al (2012 Physica A 391 87–92) proposed a deterministic small-world network by adding some edges with a simple rule in each DURT iteration. In this paper, we intoduce a method for constructing a new deterministic small-world network by the line graph operation in each DURT iteration. The line graph operation brings about cliques at each node of the previous given graph, and the resulting line graph possesses larger clustering coefficients. On the other hand, this operation can decrease the diameter at almost one, then giving the analytic solutions to several topological characteristics of the model proposed.
- 1 April 2015
- Published by Pushpa Publishing House in Far East Journal of Applied Mathematics
- Vol. 90 (3) , 189-211
ON THE MERRIFIELD-SIMMONS INDEX AND HOSOYA INDEX OF TREE-TRIANGLE GRAPHS
- 1 April 2015
- Published by Pushpa Publishing House in Far East Journal of Applied Mathematics
- Vol. 90 (3) , 189-211
ON THE MERRIFIELD-SIMMONS INDEX AND HOSOYA INDEX OF TREE-TRIANGLE GRAPHS
- 1 January 2013
- Published by Science China Press., Co. Ltd. in SCIENTIA SINICA Physica, Mechanica & Astronomica
- Vol. 43 (1) , 16-22
An evolving hypernetwork model and its properties
- 1 January 2013
- Published by Science China Press., Co. Ltd. in SCIENTIA SINICA Physica, Mechanica & Astronomica
- Vol. 43 (1) , 16-22
An evolving hypernetwork model and its properties
- 1 October 2012
- Published by Springer Nature in Acta Mathematicae Applicatae Sinica, English Series
- Vol. 28 (4) , 705-710
On the seidel integral complete multipartite graphs
- 1 October 2012
- Published by Springer Nature in Acta Mathematicae Applicatae Sinica, English Series
- Vol. 28 (4) , 705-710
On the seidel integral complete multipartite graphs
- 25 March 2012
- Published by Institute of Mathematics, Czech Academy of Sciences in Czechoslovak Mathematical Journal
- Vol. 62 (1) , 117-126
Spectral characterization of multicone graphs
A multicone graph is defined to be the join of a clique and a regular graph. Based on Zhou and Cho’s result [B. Zhou, H.H. Cho, Remarks on spectral radius and Laplacian eigenvalues of a graph, Czech. Math. J. 55 (130) (2005), 781–790], the spectral characterization of multicone graphs is investigated. Particularly, we determine a necessary and sufficient condition for two multicone graphs to be cospectral graphs and investigate the structures of graphs cospectral to a multicone graph. Additionally, lower and upper bounds for the largest eigenvalue of a multicone graph are given.
- 25 March 2012
- Published by Institute of Mathematics, Czech Academy of Sciences in Czechoslovak Mathematical Journal
- Vol. 62 (1) , 117-126
Spectral characterization of multicone graphs
A multicone graph is defined to be the join of a clique and a regular graph. Based on Zhou and Cho’s result [B. Zhou, H.H. Cho, Remarks on spectral radius and Laplacian eigenvalues of a graph, Czech. Math. J. 55 (130) (2005), 781–790], the spectral characterization of multicone graphs is investigated. Particularly, we determine a necessary and sufficient condition for two multicone graphs to be cospectral graphs and investigate the structures of graphs cospectral to a multicone graph. Additionally, lower and upper bounds for the largest eigenvalue of a multicone graph are given.
- 28 December 2004
- Published by Elsevier in Discrete Mathematics
- Vol. 289 (1-3) , 175-179
A complete solution to a conjecture on chromatic uniqueness of complete tripartite graphs
- 28 December 2004
- Published by Elsevier in Discrete Mathematics
- Vol. 289 (1-3) , 175-179
A complete solution to a conjecture on chromatic uniqueness of complete tripartite graphs