From the 1 of 9 linked papers with an AI index.
9 papers
Clique spectral extremal problem on disjoint color-critical graphs
Changjiang Bu, Peiyan Wei, Haotian Zeng
The paper determines, for sufficiently large n, the unique n‑vertex graph that maximizes the s‑clique spectral radius among all graphs that avoid a disjoint union of color‑critical…
The eigenvector centrality of hypergraphs
Changjiang Bu, Haotian Zeng, Qingying Zhang
A hypergraph is called uniform when every hyperedge contains the same number of vertices, otherwise, it is called non-uniform. In the real world, many systems give rise to non-unif…
The high order spectral extrema of -free graphs
Changjiang Bu, Yifan Sun, Haotian Zeng
In this paper, we determine the graphs with maximum value of the sum number from -clique spectral radius to -clique spectral radius among all -free graphs on …
Localization of the clique spectral version of Zykov's theorem
Changjiang Bu, Jueru Liu, Haotian Zeng
Zykov's theorem shows that -partite Turán graph uniquely has the maximum number of among all -vertex -free graphs for . The clique tensor is a hi…
A two-steps tensor eigenvector centrality for nodes and hyperedges in hypergraphs
Qing Xu, Chunmeng Liu, Changjiang Bu +1
Hypergraphs have been a powerful tool to represent higher-order interactions, where hyperedges can connect an arbitrary number of nodes. Quantifying the relative importance of node…
All eigenvalues of the blowup of a graph
Ge Lin, Changjiang Bu
The -blowup of a graph () is the -uniform hypergraph obtained by replacing each vertex with a set of size and preserving the adjacency relation. In this paper, w…