Related papers: An upper bound for higher order eigenvalues of sym…

The spectrum of the normalized graph Laplacian yields a very comprehensive set of invariants of a graph. In order to understand the information contained in those invariants better, we systematically investigate the behavior of this…

The spectrum of a graph is closely related to many graph parameters. In particular, the spectral gap of a regular graph which is the difference between its valency and second eigenvalue, is widely seen an algebraic measure of connectivity…

In this paper, we characterize all graphs with eigenvectors of the signless Laplacian and adjacency matrices with components equal to $\{- 1, 0, 1\}.$ We extend the graph parameter max $k$-cut to square matrices and prove a general sharp…

In this paper, we consider lower order eigenvalues of Laplacian operator with any order in Euclidean domains. By choosing special rectangular coordinates, we obtain two estimates for lower order eigenvalues.

This paper deals with spectral graph theory issues related to questions of monotonicity and comparison of eigenvalues. We consider finite directed graphs with non symmetric edge weights and we introduce a special self-adjoint operator as…

In this paper we study the eigenvalues of the laplacian matrices of the cyclic graphs with one edge of weight $\alpha$ and the others of weight $1$. We denote by $n$ the order of the graph and suppose that $n$ tends to infinity. We notice…

Lieb has shown a lower bound on the smallest Dirichlet eigenvalue of the Laplace operator in terms of a generalized inradius. We derive similar bounds for Robin eigenvalues, for eigenvalues of the polyharmonic operator and the sub-Laplacian…

We give an upper bound on the number of perfect matchings in an undirected simple graph $G$ with an even number of vertices, in terms of the degrees of all the vertices in $G$. This bound is sharp if $G$ is a union of complete bipartite…

In this note we elaborate on some notions of surface area for discrete graphs which are closely related to the inverse degree. These notions then naturally lead to associated connectivity measures of graphs and to the definition of a…

We prove conditions for equality between the extreme eigenvalues of a matrix and its quotient. In particular, we give a lower bound on the largest singular value of a matrix and generalize a result of Finck and Grohmann about the largest…

We establish new bounds on the minimum number of distinct eigenvalues among real symmetric matrices with nonzero off-diagonal pattern described by the edges of a graph and apply these to determine the minimum number of distinct eigenvalues…

We develop eigenvalue estimates for the Laplacians on discrete and metric graphs using different types of boundary conditions at the vertices of the metric graph. Via an explicit correspondence of the equilateral metric and discrete graph…

In this paper, we obtain a new abstract formula relating eigenvalues of a self-adjoint operator to two families of symmetric and skew-symmetric operators and their commutators. This formula generalizes earlier ones obtained by Harrell,…

This paper establishes new eigenvalue bounds for combinatorial Laplacians of simplicial complexes, extending previous results for flag complexes by Lew (2024) and general complexes by Shukla and Yogeshwaran (2020). Using elementary…

In this article we study graphs with ordering of vertices, we define a generalization called a pseudoordering, and for a graph $H$ we define the $H$-Hamiltonian number of a graph $G$. We will show that this concept is a generalization of…

In this paper, we give estimates for both upper and lower bounds of eigenvalues of a simple matrix. The estimates are shaper than the known results.

In this paper we study the maximum value of the largest eigenvalue for simple bipartite graphs, where the number of edges is given and the number of vertices on each side of the bipartition is given. We state a conjectured solution, which…

For a graph G, M(G) denotes the maximum multiplicity occurring of an eigenvalue of a symmetric matrix whose zero-nonzero pattern is given by edges of G. We introduce two combinatorial graph parameters T^-(G) and T^+(G) that give a lower and…

In this note we study the eigenvalue growth of infinite graphs with discrete spectrum. We assume that the corresponding Dirichlet forms satisfy certain Sobolev-type inequalities and that the total measure is finite. In this sense, the…

Recent work in the literature has studied fourth-order elliptic operators on manifolds with boundary. This paper proves that, in the case of the squared Laplace operator, the boundary conditions which require that the eigenfunctions and…