Related papers: Graph Laplacians with Higher Accuracy

In this article, we extend the notion of the Laplacian spread to simple directed graphs (digraphs) using the restricted numerical range. First, we provide Laplacian spread values for several families of digraphs. Then, we prove sharp upper…

A complex unit gain graph is a graph where each orientation of an edge is given a complex unit, which is the inverse of the complex unit assigned to the opposite orientation. We extend some fundamental concepts from spectral graph theory to…

Using our previously published algorithm, we analyze the eigenvectors of the generalized Laplacian for two metric graphs occurring in practical applications. As expected, localization of an eigenvector is rare and the network should be…

For a regular polyhedron (or polygon) centered at the origin, the coordinates of the vertices are eigenvectors of the graph Laplacian for the skeleton of that polyhedron (or polygon) associated with the first (non-trivial) eigenvalue. In…

We study the Laplacian on a metrized graph, and its eigenfunctions.

Inspired by the notion of action convergence in graph limit theory, we introduce a measure-theoretic representation of matrices, and we use it to define a new notion of pseudo-metric on the space of matrices. Moreover, we show that such…

We conjecture a new lower bound on the algebraic connectivity of a graph that involves the number of vertices of high eccentricity in a graph. We prove that this lower bound implies a strengthening of the Laplacian Spread Conjecture. We…

If $G$ is a graph, its Laplacian is the difference between diagonal matrix of its vertex degrees and its adjacency matrix. A one-edge connection of two graphs $G_{1}$ and $G_{2}$ is a graph $G=G_{1}\odot G_{2}$ with $V(G)=V(G_{1})\cup…

Let $G$ be a connected simple graph on $n$ vertices. Let $\mathcal{L}(G)$ be the normalized Laplacian matrix of $G$ and $\rho_{n-1}(G)$ be the second least eigenvalue of $\mathcal{L}(G)$. Denote by $\nu(G)$ the independence number of $G$.…

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…

In an attempt to characterize the structure of eigenvectors of random regular graphs, we investigate the correlations between the components of the eigenvectors associated to different vertices. In addition, we provide numerical…

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 authors of this paper have used the theory of Riordan matrices to introduce the notion of a Riordan graph in \cite{CJKM}. Riordan graphs are proved to have a number of interesting (fractal) properties, and they are a far-reaching…

A matching M is a dominating induced matching of a graph, if every edge of the graph is either in $M$ or has a common end-vertex with exactly one edge in $M$. The concept of complete dominating induced matching is introduced as graphs where…

Strong matrix properties, roughly speaking, refer to generic conditions on a matrix such that its spectral perturbation and pattern perturbation interact nicely to cover a neighborhood in the ambient space. With a rich history, these strong…

The aim of this article is to give a simple geometric condition that guarantees the existence of spectral gaps of the discrete Laplacian on periodic graphs. For proving this, we analyse the discrete magnetic Laplacian (DML) on the finite…

A network of coupled dynamical systems is represented by a graph whose vertices represent individual cells and whose edges represent couplings between cells. Motivated by the impact of synchronization results of the Kuramoto networks, we…

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.…

In this paper, we investigate the eigenvalues of the Laplacian matrix of the "graph of graphs", in which cubic graphs of order n are joined together using Whitehead moves. Our work follows recent results from arXiv:2303.13923 , which…

In this work, we present a theoretical study of signals with sparse representations in the vertex domain of a graph, which is primarily motivated by the discrepancy arising from respectively adopting a synthesis and analysis view of the…