Related papers: L-Borderenergetic graphs and Normalized Laplacian …
The energy of a graph $G$ is the sum of the absolute values of the eigenvalues of the adjacency matrix of $G$. Some variants of energy can also be found in the literature which are defined on the concepts of Laplacian matrix, Distance…
Threshold graphs are graphs that can be characterized in a number of different ways. For example, they are graphs that are $P_4,\ C_4,\ 2K_2$--free. They may also be characterized by a finite sequence of positive integers $a_1, \ldots,…
We consider weighted graphs with an infinite set of vertices. We show that boundedness of all functions of finite energy can be seen as a notion of `relative compactness' for such graphs and study sufficient and necessary conditions for…
For a simple connected graph $G$ of order $n$ having distance Laplacian eigenvalues $ \rho^{L}_{1}\geq \rho^{L}_{2}\geq \cdots \geq \rho^{L}_{n}$, the distance Laplacian energy $DLE(G)$ is defined as…
In this paper we study two classes of graphs, the (m,k)-stars and l-dependent graphs, investigating the relation between spectrum characteristics and graph structure: conditions on the topology and edge weights are given in order to get…
This paper investigates spectral properties of the deformed Laplacian matrix, which merges the Laplacian and signless Laplacian matrices of a graph through a one-parameter family of matrices. We present general results on the eigenvalues of…
We study the Laplacian spectrum of token graphs, also called symmetric powers of graphs. The $k$-token graph $F_k(G)$ of a graph $G$ is the graph whose vertices are the $k$-subsets of vertices from $G$, two of which being adjacent whenever…
We introduce new pseudo-metrics on spaces of Lagrangian submanifolds of a symplectic manifold $(M,\omega)$ by considering areas associated to projecting Lagrangian cobordisms in $\mathbb{C} \times M$ to the "time-energy plane" $\mathbb{C}$.…
In this article we consider the spectrum of a Laplacian matrix, also known as the Markov matrix, under the independence assumption. We assume that the entries have a variance profile. Motivated by recent works on generalized Wigner matrices…
Graphs with diverse structural characteristics play a central role in modelling and optimization tasks. The ability to generate different types of graphs that exhibit shared properties is likewise essential for algorithm selection and…
This short note aims at (re)proving that the symmetrically normalized graph Laplacian $L=\Id - D^{-1/2}WD^{-1/2}$ (from a graph defined from a Gaussian weighting kernel on a sampled smooth manifold) converges towards the continuous Manifold…
We present a construction of harmonic functions on bounded domains for the spectral fractional Laplacian operator and we classify them in terms of their divergent profile at the boundary. This is used to establish and solve boundary value…
The Cheeger inequalities give an upper and lower bound on the spectral gap of discrete Laplacians defined on a graph in terms of the geometric characteristics of the graph. We generalise this approach and we employ it to determine if a…
This paper characterizes the graphical properties of an optimal topology with minimal Laplacian energy under the constraint of fixed numbers of vertices and edges, and devises an algorithm to construct such connected optimal graphs. These…
In this paper, we introduce central vertex corona, central edge corona, and central edge neighborhood corona of graphs using central graph. Also, we determine their adjacency spectrum, Laplacian spectrum and signless Laplacian spectrum.…
Graph neural networks process information on graphs represented at a given resolution scale. We analyze the effect of using different coarse-grained graph resolutions, obtained through the Laplacian renormalization group theory, on node…
Networks with a prescribed power-law scaling in the spectrum of the graph Laplacian can be generated by evolutionary optimization. The Laplacian spectrum encodes the dynamical behavior of many important processes. Here, the networks are…
We define renormalised energies for maps that describe the first-order asymptotics of harmonic maps outside of singularities arising due to obstructions generated by the boundary data and the mutliple connectedness of the target manifold.…
Quantum graphs are defined by having a Laplacian defined on the edges of a metric graph with boundary conditions on each vertex such that the resulting operator, $\mathbf{L}$, is self-adjoint. We use Neumann boundary conditions although we…
We consider metric graphs with a uniform lower bound on the edge lengths but no further restrictions. We discuss how to describe every local self-adjoint Laplace operator on such graphs by boundary conditions in the vertices given by…