Related papers: Spectral Theory for Discrete Lapacians

We investigate spectral properties of Kirchhoff Laplacians on radially symmetric antitrees. This class of metric graphs enjoys a rich group of symmetries, which enables us to obtain a decomposition of the corresponding Laplacian into the…

Let $G$ be a simple graph. A pendant path of $G$ is a path such that one of its end vertices has degree $1$, the other end has degree $\ge3$, and all the internal vertices have degree $2$. Let $p_k(G)$ be the number of pendant paths of…

We previously demonstrated that the bulk transport coefficients of uniaxial polycrystalline materials, including electrical and thermal conductivity, diffusivity, complex permittivity, and magnetic permeability, have Stieltjes integral…

Graph spectral analysis can yield meaningful embeddings of graphs by providing insight into distributed features not directly accessible in nodal domain. Recent efforts in graph signal processing have proposed new decompositions-e.g., based…

We present a framework based on spectral graph theory that captures the interplay among network topology, system inertia, and generator and load damping in determining the overall grid behavior and performance. Specifically, we show that…

Let $M$ be a compact connected manifold of dimension $n$ endowed with a conformal class $C$ of Riemannian metrics of volume one. For any integer $k\geq0$, we consider the conformal invariant $\lambda_k ^c (C)$ defined as the supremum of the…

A metrized graph is a compact singular 1-manifold endowed with a metric. A given metrized graph can be modelled by a family of weighted combinatorial graphs. If one chooses a sequence of models from this family such that the vertices become…

In this work we introduce a concept of complexity for undirected graphs in terms of the spectral analysis of the Laplacian operator defined by the incidence matrix of the graph. Precisely, we compute the norm of the vector of eigenvalues of…

The spectral theory for operator pencils and operator differential-algebraic equations is studied. Special focus is laid on singular operator pencils and three different concepts of singularity of operator pencils are introduced. The…

We study some spectral properties of a matrix that is constructed as a combination of a Laplacian and an adjacency matrix of simple graphs. The matrix considered depends on a positive parameter, as such we consider the implications in…

Let $D(G)$ denote the distance matrix of a connected graph $G$ with $n$ vertices. The distance spectral gap of a graph $G$ is defined as $\delta_{D^G} = \rho_1 - \rho_2$, where $\rho_1$ and $\rho_2$ represent the largest and second largest…

This paper studies the Laplacian spectral characterization of some graph products. We consider a class of connected graphs: $\mathscr{G}={G : |EG|\leq|VG|+1}$, and characterize all graphs $G\in\mathscr{G}$ such that the products $G\times…

This paper presents sufficient conditions for Hamiltonian paths and cycles in graphs. Letting $\lambda\left( G\right) $ denote the spectral radius of the adjacency matrix of a graph $G,$ the main results of the paper are: (1) Let $k\geq1,$…

A biperiodic planar network is a pair $(G,c)$ where $G$ is a graph embedded on the torus and $c$ is a function from the edges of $G$ to non-zero complex numbers. Associated to the discrete Laplacian on a biperiodic planar network is its…

In this paper, it is shown that the graph $T_4(p,q,r)$ is determined by its Laplacian spectrum and there are no two non-isomorphic such graphs which are cospectral with respect to adjacency spectrum.

This paper presents bounds for the variation of the spectral radius $\lambda(G)$ of a graph $G$ after some perturbations or local vertex/edge modifications of $G$. The perturbations considered here are the connection of a new vertex with,…

We study the spectral stability of a 2D discrete Schr\"{o}dinger equation on a square lattice, in the simultaneous presence of a fractional Laplacian and $\cal{PT}$ symmetry. For that purpose, we compute the plane-wave spectrum in closed…

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…

Persistent homology is constrained to purely topological persistence while multiscale graphs account only for geometric information. This work introduces persistent spectral theory to create a unified low-dimensional multiscale paradigm for…

The adjacency and Laplacian matrices of complex networks with two species of nodes are studied and the spectral density is evaluated by using the replica method in statistical physics. The network nodes are classified into two species (A…