3 citations · 4 across the 5 of their papers we have counts for
9 papers · 1 filter
Spectral bounds for the independence number of graphs and even uniform hypergraphs
Xinyu Hu, Jiang Zhou, Changjiang Bu
In this paper, we give spectral upper bounds for the independence number of even uniform hypergraphs and graphs, extend the Hoffman bound to even uniform hypergraphs, and give a si…
Spectral characterizations of local structures of graphs and hypergraphs
Jiang Zhou, Changjiang Bu
In this paper, we give the relationship between spectral radius and local structures of graphs and hypergraphs. Our work shows that certain local subgraphs (subhypergraphs) must oc…
Perron-Frobenius theorem for dual tensors and its applications
Changjiang Bu, Yue Chu, Qingying Zhang +1
The Perron-Frobenius theorem of nonnegative matrices is a classical result on spectral theory of matrices, which has wide applications in many domains. In this paper, we give the P…
An Erdős-Stone type result for high-order spectra of graphs
Chunmeng Liu, Jiang Zhou, Changjiang Bu
Erdős-Stone Theorem is a well-known result in extremal graph theory which determines the asymptotic behaviour of maximum number of edges in an -vertex -free graph. In 2009, N…
Oriented spanning trees and stationary distribution of digraphs
Jiang Zhou, Changjiang Bu
By using biclique partitions of digraphs, this paper gives reduction formulas for the number of oriented spanning trees, stationary distribution vector and Kemeny's constant of dig…
Spectral radius and clique partitions of graphs
Jiang Zhou, Edwin R. van Dam
We give lower bounds on the size and total size of clique partitions of a graph in terms of its spectral radius and minimum degree, and derive a spectral upper bound for the maximu…