Related papers: Interlacing inequalities for eigenvalues of discre…
Hypergraphs are a generalization of graphs in which edges can connect any number of vertices. They allow the modeling of complex networks with higher-order interactions, and their spectral theory studies the qualitative properties that can…
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)…
We apply eigenvalue interlacing techniques for obtaining lower and upper bounds for the sums of Laplacian eigenvalues of graphs, and characterize equality. This leads to generalizations of, and variations on theorems by Grone, and Grone and…
Eigenvalue interlacing is a useful tool in linear algebra and spectral analysis. In its simplest form, the interlacing inequality states that a rank-one positive perturbation shifts each eigenvalue up, but not further than the next…
We consider interpolation inequalities for imbeddings of the $l^2$-sequence spaces over $d$-dimensional lattices into the $l^\infty_0$ spaces written as interpolation inequality between the $l^2$-norm of a sequence and its difference. A…
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…
This paper explores interlacing inequalities in the Laplacian spectrum of signed cycles and investigates interlacing relationship between the spectrum of the net-Laplacian of a signed graph and its subgraph formed by removing a vertex…
The vertex-weighted Laplacian naturally extends the combinatorial Laplacian for simplicial complexes. Inspired by Lew's foundational techniques for vertex-weighted Laplacians, we present a comprehensive spectral analysis of this operator.…
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…
We first develop a general framework for Laplace operators defined in terms of the combinatorial structure of a simplicial complex. This includes, among others, the graph Laplacian, the combinatorial Laplacian on simplicial complexes, the…
In this note, we use eigenvalue interlacing to derive an inequality between the maximum degree of a graph and its maximum and minimum adjacency eigenvalues. The case of equality is fully characterized.
The aim of the present paper is to analyse the spectrum of Laplace and Dirac type operators on metric graphs. In particular, we show for equilateral graphs how the spectrum (up to exceptional eigenvalues) can be described by a natural…
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…
We prove interlacing inequalities between spectral minimal energies of metric graphs built on Dirichlet and standard Laplacian eigenvalues, as recently introduced in [Kennedy et al, arXiv:2005.01126]. These inequalities, which involve the…
A large variety of dynamical processes that take place on networks can be expressed in terms of the spectral properties of some linear operator which reflects how the dynamical rules depend on the network topology. Often such spectral…
The Laplacian matrix of a simple graph is the difference of the diagonal matrix of vertex degree and the (0,1) adjacency matrix. In the past decades, the Laplacian spectrum has received much more and more attention, since it has been…
Laplacian operators on finite compact metric graphs are considered under the assumption that matching conditions at graph vertices are of $\delta$ and $\delta'$ types. An infinite series of trace formulae is obtained which link together two…
In this paper, we derive an upper bound for higher order eigenvalues of the normalized Laplace operator associated with a symmetric finite graph in terms of lower order eigenvalues.
We present a systematic collection of spectral surgery principles for the Laplacian on a metric graph with any of the usual vertex conditions (natural, Dirichlet or $\delta$-type), which show how various types of changes of a local or…
We present sharp inequalities relating the number of vertices, edges, and triangles of a graph to the smallest eigenvalue of its adjacency matrix and the largest eigenvalue of its Laplacian.