Related papers: On Directed Graphs With Real Laplacian Spectra
Pinning control of a complex network aims at forcing the states of all nodes to track an external signal by controlling a small number of nodes in the network. In this paper, an algebraic graph-theoretic condition is introduced to optimize…
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 present some spectral sufficient conditions for a graph to be Hamilton-connected in terms of the spectral radius or signless Laplacian spectral radius of the graph. Our results improve some previous work.
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…
In this paper we consider the discrete Laplacian acting on 1-forms and we study its spectrum relative to the spectrum of the 0-form Laplacian. We show that the non zero spectrum can coincide for these Laplacians with the same nature. We…
How does coarsening affect the spectrum of a general graph? We provide conditions such that the principal eigenvalues and eigenspaces of a coarsened and original graph Laplacian matrices are close. The achieved approximation is shown to…
We address the Laplacian on a perturbed periodic graph which might not be a periodic graph. We present a class of perturbed graphs for which the essential spectra of the Laplacians are stable even when the graphs are perturbed by adding and…
Multilayer networks have been the subject of intense research during the last few years, as they represent better the interdependent nature of many real world systems. Here, we address the question of describing the three different…
Typically, graph structures are represented by one of three different matrices: the adjacency matrix, the unnormalised and the normalised graph Laplacian matrices. The spectral (eigenvalue) properties of these different matrices are…
This paper is devoted to the investigation of the spectral theory and dynamical properties of periodic graphs which are not locally finite but carry non-negative, symmetric and summable edge weights. These graphs are shown to exhibit rather…
Quantum graphs have attracted attention from mathematicians for some time. A quantum graph is defined by having a Laplacian on each edge of a metric graph and imposing boundary conditions at the vertices to get an eigenvalue problem. A…
In this paper, we examine the controllability of Laplacian dynamic networks on cographs. Cographs appear in modeling a wide range of networks and include as special instances, the threshold graphs. In this work, we present necessary and…
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…
Lattice structures play a central role in spectral graph theory, offering analytical insight into diffusion, synchronization, and transport processes on regular discrete spaces. While their spectral properties are completely characterized…
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…
We show that, with very high probability, the random graph Laplacian has simple spectrum. Our method provides a quantitatively effective estimate of the spectral gaps. Along the way, we establish results on affine no-gaps delocalization,…
Laplacian flows model the rate of change of each node's state as being proportional to the difference between its value and that of its neighbors. Typically, these flows capture diffusion or synchronization dynamics and are well-studied.…
In this paper, we establish a tight sufficient condition for the Hamiltonicity of graphs with large minimum degree in terms of the signless Laplacian spectral radius and characterize all extremal graphs. Moreover, we prove a similar result…
In this paper, we examine covering graphs that are obtained from the $d$-dimensional integer lattice by adding pendant edges. In the case of $d=1$, we show that the Laplacian on the graph has a spectral gap and establish a necessary and…
Determining the effect of structural perturbations on the eigenvalue spectra of networks is an important problem because the spectra characterize not only their topological structures, but also their dynamical behavior, such as…