Zobrazeno 1 - 10
of 85
pro vyhledávání: '"Qiongxiang Huang"'
Publikováno v:
Discrete Dynamics in Nature and Society, Vol 2017 (2017)
In this paper, we mainly study the performance of star-composed networks which can achieve consensus. Specifically, we investigate the convergence speed and robustness of the consensus of the networks, which can be measured by the smallest nonzero ei
Externí odkaz:
https://doaj.org/article/32b0fb04722e4d1689ced46a6702006f
Publikováno v:
CSIAM Transactions on Applied Mathematics. 3:335-350
Publikováno v:
Linear Algebra and its Applications. 640:162-178
Autor:
Qiongxiang Huang, Fei Wen
Publikováno v:
Czechoslovak Mathematical Journal. 72:371-390
Autor:
Qiongxiang Huang, Qianqian Chen
Publikováno v:
Linear and Multilinear Algebra. 70:5193-5206
Let Gn,β be the set of simple graphs of order n with given matching number β. In this paper, we characterize the extremal graphs with maximal Aα-spectral radius in Gn,β for 0≤α
Publikováno v:
Linear Algebra and its Applications. 608:270-281
A complex unit gain graph is a graph where each orientation of an edge is given a complex unit, which is the inverse of the complex unit assigned to the opposite orientation. In this paper, we characterize the structure of the complex unit gain graph
Publikováno v:
Linear and Multilinear Algebra. 70:2187-2197
Let Π be an equitable partition of a graph G with k cells. If G has no equitable partition with fewer cells than Π, then Π is called a minimal partition of G and G is called a k-equitable graph. It...
Autor:
Qiongxiang Huang, Lu Lu
Publikováno v:
Filomat. 34:2805-2812
Let Zn2 be the elementary abelian 2-group, which can be viewed as the vector space of dimension n over F2. Let {e1,..., en} be the standard basis of Zn2 and ?k = ek +...+ en for some 1 ? k ? n-1. Denote by ?n,k the Cayley graph over Zn2 with generati
Publikováno v:
Advances in Applied Mathematics. 144:102457
In 1977 Smith characterized graphs with exactly one positive eigenvalue. Since then, many particular results related to graphs with exactly two positive eigenvalues have emerged. In this paper we conclude this investigation by giving a full character
Publikováno v:
Graphs and Combinatorics. 35:867-880
A threshold graph G of order n is defined by binary sequence of length n. In this paper, we consider the adjacent matrix of a connected threshold graph, and give the eigenvalues distribution in threshold graphs. Moreover, we pick out all the threshol