Related papers: Isospectral graphs via spectral bracketing
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…
A new family of strongly regular graphs, called the general symplectic graphs $Sp(2\nu, q)$, associated with nonsingular alternate matrices is introduced. Their parameters as strongly regular graphs, their chromatic numbers as well as their…
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 concept of germ graphs and the M-function formalism are employed to construct large families of isospectral and isoscattering graphs. This approach represents a complete departure from the original approach pioneered by Sunada, where…
In this paper, we construct some non-normal Cayley graphs and explicitly provide their spectra and eigenspaces using representation theory of finite groups.
We consider the problem of designing spectral graph filters for the construction of dictionaries of atoms that can be used to efficiently represent signals residing on weighted graphs. While the filters used in previous spectral graph…
We propose a Laplacian based on general inner product spaces, which we call the inner product Laplacian. We show the combinatorial and normalized graph Laplacians, as well as other Laplacians for hypergraphs and directed graphs, are special…
We consider a family of non-compact manifolds $X_\eps$ (``graph-like manifolds'') approaching a metric graph $X_0$ and establish convergence results of the related natural operators, namely the (Neumann) Laplacian $\laplacian {X_\eps}$ and…
In this paper, we present GGSD, a novel graph generative model based on 1) the spectral decomposition of the graph Laplacian matrix and 2) a diffusion process. Specifically, we propose to use a denoising model to sample eigenvectors and…
Let $G$ be a finite non abelian group. The centralizer graph of $G$ is a simple undirected graph $\Gamma_{cent}(G)$, whose vertices are the proper centralizers of $G$ and two vertices are adjacent if and only if their cardinalities are…
In this paper, we propose algorithms for the graph isomorphism (GI) problem that are based on the eigendecompositions of the adjacency matrices. The eigenvalues of isomorphic graphs are identical. However, two graphs $ G_A $ and $ G_B $ can…
In this paper, we compute normalized Laplacian spectra of central graph of a regular graph, central vertex join and central edge join of two regular graphs. Also, we determine their Kemeny's constant and degree Kirchhoff index.
The Bridge graph is a special type of graph which are constructed by connecting identical connected graphs with path graphs. We discuss different types of bridge graphs $B_{n\times l}^{m\times k}$ in this paper. In particular, we discuss…
In this paper, we introduce a generalization of corona of graphs. This construction generalizes the generalized corona of graphs (consequently, the corona of graphs), the cluster of graphs, the corona-vertex subdivision graph of graphs and…
In this paper we present new L-borderenergetic graphs, this is, graphs which are L-noncospectral with Kn but have the same Laplacian energy. We also present some graphs which are noncospectral to respective normalized Laplacian energy and…
The smallest eigenvalues and the associated eigenvectors (i.e., eigenpairs) of a graph Laplacian matrix have been widely used for spectral clustering and community detection. However, in real-life applications the number of clusters or…
In this paper, we use the theory of Riordan matrices to introduce the notion of a Riordan graph. The Riordan graphs are a far-reaching generalization of the well known and well studied Pascal graphs and Toeplitz graphs, and also some other…
Given an arbitrary connected $G$, the $n$-polygon graph $\tau_n(G)$ is obtained by adding a path with length $n$ $(n\geq 2)$ to each edge of graph $G$, and the iterated $n$-polygon graphs $\tau_n^g(G)$ ($g\geq 0$), is obtained from the…
Recently normalized Laplacian matrices of graphs are studied as density matrices in quantum mechanics. Separability and entanglement of density matrices are important properties as they determine the nonclassical behavior in quantum…
Laplacian eigenvectors capture natural community structures on graphs and are widely used in spectral clustering and manifold learning. The use of Laplacian eigenvectors as embeddings for the purpose of multiscale graph comparison has…