Related papers: Eigenvalue bounds for combinatorial Laplacians and…

We prove that the maximum eigenvalue of the (both signed and unsigned) Laplacian of level $k$ Kikuchi graph of any graph $G$ with $m$ edges is at most $m+k$. This confirms four recent conjectures of Apte, Parekh, and Sud. As applications,…

We prove sharp upper bounds for the first and second non-trivial eigenvalues of the Neumann Laplacian in two classes of domains: parallelograms and domains of constant width. This gives in particular a new proof of an isoperimetric…

We give a combinatorial characterization of graphs whose normalized Laplacian has three distinct eigenvalues. Strongly regular graphs and complete bipartite graphs are examples of such graphs, but we also construct more exotic families of…

We exploit the connection between quantum dot Dirac operators and $\overline\partial$-Robin Laplacians. First, we find a graphical relation between their smallest positive eigenvalues, which allows us to deduce a recipe for translating…

We study Hadamard variation of eigenvalues of Laplacian with respect to general domain perturbations. We show their existence up to the second order rigorously and characterize the derivatives, using associated eigenvalue problems in finite…

In this article we give bounds for the eigenvalues of a matrix, which can be seen as a common generalization of meet and join matrices and therefore also as a generalization of both GCD and LCM matrices. Although there are some results…

Let $G$ be a simple graph with adjacency matrix $A(G)$, signless Laplacian matrix $Q(G)$, degree diagonal matrix $D(G)$ and let $l(G)$ be the line graph of $G$. In 2017, Nikiforov defined the $A_\alpha$-matrix of $G$, $A_\alpha(G)$, as a…

In this paper, we study extremal problems of Steklov eigenvalues on combinatorial graphs by extending Friedman's theory [Duke Math. J. 69 (1993), no. 3, 487--525] of nodal domains for Laplacian eigenfunctions to Steklov eigenfunctions, and…

In this paper, we establish Brezin-Li-Yau type lower bounds for averaged sums of Dirichlet eigenvalues of the Laplacian and poly-Laplacian on bounded domains in Euclidean spaces. By deriving expansions of two binary polynomials which may be…

We construct several pairwise-incomparable bounds on the projective dimensions of edge ideals. Our bounds use combinatorial properties of the associated graphs; in particular we draw heavily from the topic of dominating sets. Through…

For a given graph $G$, we aim to determine the possible realizable spectra for a generalized (or sometimes referred to as a weighted) Laplacian matrix associated with $G$. This new specialized inverse eigenvalue problem is considered for…

We extend the results given by Colbois, Dryden and El Soufi on the relationships between the eigenvalues of the Laplacian and an extrinsic invariant called intersection index, in two directions. First, we replace this intersection index by…

We discuss Laplacian spectrum on a finite metric graph with vertex couplings violating the time-reversal invariance. For the class of star graphs we determine, under the condition of a fixed total edge length, the configurations for which…

New isoperimetric inequalities for lower order eigenvalues of the Laplacian on closed hypersurfaces, of the biharmonic Steklov problems and of the Wentzell-Laplace on bounded domains in a Euclidean space are proven. Some open questions for…

We investigate the lower bound for higher eigenvalues $\lambda_i$ of the poly-Laplace operator on a bounded domain and improve the famous Li-Yau inequality and its related results. Firstly, we consider the low dimensional cases for the…

Weighted hypergraphs are generalizations of weighted simplicial complexes. In recent years, weighted Laplacians of weighted simplicial complexes have been studied. In 2016, as a generalization of the homology of simplicial complexes, the…

We prove upper bounds for sub-Laplacian eigenvalues independent of a pseudo-Hermitian structure on a CR manifold. These bounds are compatible with the Menikoff-Sjoestrand asymptotic law, and can be viewed as a CR version of Korevaar's…

This paper establishes new upper bounds for the right eigenvalues of monic matrix polynomials over the quaternion division algebra. The noncommutative nature of quaternion multiplication presents fundamental challenges in eigenvalue…

Eigenvalue interlacing is a versatile technique for deriving results in algebraic combinatorics. In particular, it has been successfully used for proving a number of results about the relation between the (adjacency matrix or Laplacian)…

Because of the significant increase in size and complexity of the networks, the distributed computation of eigenvalues and eigenvectors of graph matrices has become very challenging and yet it remains as important as before. In this paper…