Related papers: Spectral determinant on quantum graphs

We show that families of leafless quantum graphs that are isospectral for the standard Laplacian are finite. We show that the minimum edge length is a spectral invariant. We give an upper bound for the size of isospectral families in terms…

We study the interplay between spectrum, geometry and boundary conditions for two distinguished self-adjoint realisations of the Laplacian on infinite metric graphs, the so-called riedrichs and Neumann extensions. We introduce a new…

Using spectral embedding based on the signless Laplacian, we obtain bounds on the spectrum of transition matrices on graphs. As a consequence, we bound return probabilities and the uniform mixing time of simple random walk on graphs. In…

A derivation of the spectral determinant of the Schr\"odinger operator on a metric graph is presented where the local matching conditions at the vertices are of the general form classified according to the scheme of Kostrykin and Schrader.…

Using methods from algebraic graph theory and convex optimization, we study the relationship between local structural features of a network and spectral properties of its Laplacian matrix. In particular, we derive expressions for the…

In this paper, we present two new matrices, namely the resistance Laplacian and resistance signless Laplacian matrix of a connected graph. We provide a generalized form of these matrices for different classes of graphs, including the…

We present a method for proving upper bounds on the eigenvalues of the graph Laplacian. A main step involves choosing an appropriate "Riemannian" metric to uniformize the geometry of the graph. In many interesting cases, the existence of…

We investigate the behavior of various spectral invariants, particularly the determinant of the Laplacian, on a family of smooth Riemannian manifolds which undergo conic degeneration; that is, which converge in a particular way to a…

Using functions from electrical networks (graphs with resistors assigned to edges), we prove existence (with explicit formulas) of a canonical Parseval frame in the energy Hilbert space $\mathscr{H}_{E}$ of a prescribed infinite (or finite)…

In this paper, we introduce the Laplacian and the signless Laplacian for the eccentricity matrix of a connected graph, referred to as the eccentricity Laplacian and the eccentricity signless Laplacian, respectively. We establish the…

We derive an expression for the spectral determinant of a second-order elliptic differential operator $\mathcal{T}$ defined on the whole real line, in terms of the Wronskians of two particular solutions of the equation $\mathcal{T} u=0$.…

We define a number of natural (from geometric and combinatorial points of view) deformation spaces of valuations on finite graphs, and study functions over these deformation spaces. These functions include both direct metric invariants…

M. Aouchiche and P. Hansen proposed the distance Laplacian and the distance signless Laplacian of a connected graph [Two Laplacians for the distance matrix of a graph, LAA 439 (2013) 21{33]. In this paper, we obtain three theorems on the…

Given a Hermitian vector bundle over an infinite weighted graph, we define the Laplacian associated to a unitary connection on this bundle and study the essential self-adjointness of a perturbation of this Laplacian by an operator-valued…

We present the spectrum of the (normalized) graph Laplacian as a systematic tool for the investigation of networks, and we describe basic properties of eigenvalues and eigenfunctions. Processes of graph formation like motif joining or…

We investigate the behaviour of the regularized determinant of the Laplace-Beltrami operator on compact hyperbolic surfaces when the genus goes to infinity. We show that for all popular models of random surfaces, with high probability as…

{Signless Laplacian determinations of some graphs with independent edges}% {Let $G$ be a simple undirected graph. Then the signless Laplacian matrix of $G$ is defined as $D_G + A_G$ in which $D_G$ and $A_G$ denote the degree matrix and the…

Classical spectral graph theory relies on the symmetry of the adjacency and Laplacian operators, which guarantees orthogonal eigenbases and energy-preserving Fourier transforms. However, real-world networks are intrinsically directed and…

For a finite graph, we establish natural isomorphisms between eigenspaces of a Laplace operator acting on functions on the edges and eigenspaces of a transfer operator acting on functions on one-sided infinite non-backtracking paths.…

We obtain new bounds for the Laplacian spectral radius of a signed graph. Most of these new bounds have a dependence on edge sign, unlike previously known bounds, which only depend on the underlying structure of the graph. We then use some…