Related papers: On Directed Graphs With Real Laplacian Spectra
We investigate the structure of conformally rigid graphs. Graphs are conformally rigid if introducing edge weights cannot increase (decrease) the second (last) eigenvalue of the Graph Laplacian. Edge-transitive graphs and distance-regular…
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse…
The construction of a meaningful graph plays a crucial role in the success of many graph-based representations and algorithms for handling structured data, especially in the emerging field of graph signal processing. However, a meaningful…
A factor of a graph is a spanning subgraph. Spectral sufficient conditions are provided via spectral radius and signless Laplacian spectral radius for graphs with (i) a matching of given size (particularly, $1$-factor) containing any given…
To address the peculiarities of directed and/or signed graphs, new Laplacian operators have emerged. For instance, in the case of directionality, we encounter the magnetic operator, dilation (which is underexplored), operators based on…
For a two-dimensional curved waveguide, it is well known that the spectrum of the Dirichlet Laplacian is unstable. Any perturbation of the straight strip produces eigenvalues below the essential spectrum. In this paper, a magnetic field is…
In this paper we generalise the results on eigenvalues and eigenvectors of unnormalized (combinatorial) Laplacian of two-dimensional grid presented by Edwards:2013 first to a grid graph of any dimension, and second also to other types of…
Graph Laplacians computed from weighted adjacency matrices are widely used to identify geometric structure in data, and clusters in particular; their spectral properties play a central role in a number of unsupervised and semi-supervised…
Network synchronization is an emerging phenomenon in complex networks. The spectrum of Laplacian matrix will be immensely helpful for getting the network dynamics information. Especially, network synchronizability is characterized by the…
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…
Graph signal processing (GSP) is a key tool for satisfying the growing demand for information processing over networks. However, the success of GSP in downstream learning and inference tasks is heavily dependent on the prior identification…
The second-largest eigenvalue and second-smallest Laplacian eigenvalue of a graph are measures of its connectivity. These eigenvalues can be used to analyze the robustness, resilience, and synchronizability of networks, and are related to…
The main goal of the paper is to characterize new classes of multicone graphs which are determined by both adjacency and Laplacian spectra. A multicone graph is defined to be the join of a clique and a regular graph. A wheel graph obtained…
This paper provides a framework to evaluate the performance of single and double integrator networks over arbitrary directed graphs. Adopting vehicular network terminology, we consider quadratic performance metrics defined by the L2-norm of…
We report on some recent developments in the search for optimal network topologies. First we review some basic concepts on spectral graph theory, including adjacency and Laplacian matrices, and paying special attention to the topological…
The spectral properties of signed directed graphs, which may be naturally obtained by assigning a sign to each edge of a directed graph, have received substantially less attention than those of their undirected and/or unsigned counterparts.…
We study spectral properties of the standard (also called Kirchhoff) Laplacian and the anti-standard (or anti-Kirchhoff) Laplacian on a finite, compact metric graph. We show that the positive eigenvalues of these two operators coincide…
We propose a method by which to recover an underlying graph from a set of multivariate wave signals that is discretely sampled from a solution of the graph wave equation. Herein, the graph wave equation is defined with the graph Laplacian,…
The theory of graphons has proven to be a powerful tool in many areas of graph theory. In this paper, we introduce several foundational aspects of the theory of digraphons -- asymmetric two-variable functions that arise as limits of…
Understanding the mutual interdependence between the behavior of dynamical processes on networks and the underlying topologies promises new insight for a large class of empirical networks. We present a generic approach to investigate this…