1 citations · 1 across the 13 of their papers we have counts for
13 papers · 1 filter
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 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…
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…