1 citations · 1 across the 18 of their papers we have counts for
18 papers
Spectral moments and characteristic polynomials of vertex expansion hypergraphs of graphs
Ge Lin, Changjiang Bu
The -vertex expansion hypergraph is the -uniform hypergraph obtained by replacing each vertex of a graph with new vertices. A closed walk in is called…
Clique spectral extremal problem on disjoint color-critical graphs
Changjiang Bu, Peiyan Wei, Haotian Zeng
For a given graph , a graph is called -free if it does not contain as a subgraph. A graph is color-critical if deleting one of its edges decreases its chromatic numbe…
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 hig…
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…
The -core of a graph and its high-order spectra
Chunmeng Liu, Qing Xu, Changjiang Bu
The -core of a graph is its largest subgraph with minimum degree at least , a fundamental concept for uncovering hierarchical structures. In this paper, we establish a connec…
The characteristic polynomial of sunflowers
Changjiang Bu, Lixiang Chen, Ge Lin
A uniform hypergraph is called a sunflower if all of its hyperedges intersect in the same set of vertices. In this paper, we determine the eigenvalues and spectral moments of a sun…
On the second-largest modulus among the eigenvalues of a power hypergraph
Changjiang Bu, Lixiang Chen, Yongtang Shi
It is well known that the algebraic multiplicity of an eigenvalue of a graph (or real symmetric matrix) is equal to the dimension of its corresponding linear eigen-subspace, also k…
The Laplacian spectral moments of power hypergraphs
Jueru Liu, Lixiang Chen, Changjiang Bu
The -th order Laplacian spectral moment of a -uniform hypergraph is the sum of the -th powers of all eigenvalues of its Laplacian tensor. In this paper, we obtain some exp…
The multiplicity of the zero Laplacian eigenvalue of uniform hypertrees
Ge Lin, Changjiang Bu
In this paper, the Laplacian characteristic polynomial of uniform hypergraphs with cut vertices or pendant edges and the Laplacian matching polynomial of uniform hypergraphs are ch…
The algebraic multiplicity of the spectral radius of a hypertree
Lixiang Chen, Changjiang Bu
It is well-known that the spectral radius of a connected uniform hypergraph is an eigenvalue of the hypergraph. However, its algebraic multiplicity remains unknown. In this paper,…
Spectra of power hypergraphs and signed graphs via parity-closed walks
Lixiang Chen, Edwin R. van Dam, Changjiang Bu
The -power hypergraph is the -uniform hypergraph that is obtained by adding new vertices to each edge of a graph , for . A parity-closed walk in…
On a generalization of the spectral Mantel's theorem
Chunmeng Liu, Changjiang Bu
Mantel's theorem is a classical result in extremal graph theory which implies that the maximum number of edges of a triangle-free graph of order . In 1970, E. Nosal obtained a s…
All eigenvalues of the power hypergraph and signed subgraphs of a graph
Lixiang Chen, Edwin R. van Dam, Changjiang Bu
We show how all eigenvalues of a power hypergraph can be generated from the eigenvalues of signed subgraphs of the underlying graph . This fixes an incorrect statement…
High-ordered spectral characterizations of graphs
Lixiang Chen, Lizhu Sun, Changjiang Bu
The spectrum of the -power hypergraph of a graph is called the -ordered spectrum of .If graphs and have same -ordered spectrum for all positive integer…
The reduced formula of the characteristic polynomial of hypergraphs and the spectrum of hyperpaths
Changjiang Bu, Lixiang Chen
In this paper, we give a reduced formula of the characteristic polynomial of -uniform hypergraphs with a pendant edge. And the explicit characteristic polynomial and all distinc…