5 papers
Almost all graphs have no cospectral mates with height relative small to its order
Da Zhao
The main result of this paper shows that almost all graphs of order have no cospectral mates with height , improving an earlier result on cospectral mat…
Estimates of the first Dirichlet eigenvalue of graphs
Huiqiu Lin, Lianping Liu, Zhe You +1
Inspired by the Li--Yau eigenvalue-diameter estimates, we investigate lower bounds for the first Dirichlet eigenvalue in terms of the diameter (or inscribed radius) of a graph. Let…
Comparison between the first Steklov eigenvalue and algebraic connectivity on trees
Huiqiu Lin, Da Zhao
Trees can be regarded as discrete analogue of Hadamard manifolds, namely simply-connected Riemannian manifolds of non-positive sectional curvature. In this paper, we compare the fi…
Maximize the Steklov eigenvalue of trees
Huiqiu Lin, Da Zhao
We study the maximal Steklov eigenvalues of trees with given number of boundary vertices and total number of vertices. Trees can be regarded as discrete analogue of Hadamard manifo…
Upper bounds of Steklov eigenvalues on graphs
Huiqiu Lin, Lianping Liu, Zhe You +1
Let and be the maximum vertex degree and a subset of vertices in a graph respectively. In this paper, we study the first (non-trivial) Steklov eigenvalue of w…