1 citations · 1 across the 10 of their papers we have counts for
10 papers
Generic properties of discrete Steklov eigenfunctions
Lixiang Chen, Bobo Hua, Yongtang Shi
Let be a finite connected graph with boundary . We prove that for a generic positive edge weight function , the Steklov eigenvalues of $(G,B,w)…
The first Steklov eigenvalue bound for graphs of positive genus
Lixiang Chen, Yongtang Shi, Liwen Zhang
Let be a graph of genus with boundary . For , Lin and Zhao [J. Lond. Math. Soc. 112 (2025), Paper No. e70238] proved an upper bound for the first (non-trivial) Ste…
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 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…
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…