Related papers: Constructing Cospectral Vertices Through Orbits of…
Determining whether two graphs are structurally identical is a fundamental problem with applications spanning mathematics, computer science, chemistry, and network science. Despite decades of study, graph isomorphism remains a challenging…
We consider a non self-adjoint Laplacian on a directed graph with non symmetric edge weights. We give necessary conditions for this Laplacian to be sectorial. We introduce a special self-adjoint operator and compare its essential spectrum…
We show that real tight frames that generate lattices must be rational, and use this observation to describe a construction of lattices from vertex transitive graphs. In the case of irreducible group frames, we show that the corresponding…
In this paper we introduce the notion of cofrontal mappings, as the dual objects to frontal mappings, and study their basic local and global properties. Cofrontals are very special mappings and far from generic nor stable except for the…
We investigate quantum graphs with infinitely many vertices and edges without the common restriction on the geometry of the underlying metric graph that there is a positive lower bound on the lengths of its edges. Our central result is a…
It is now well known that ultracontractive properties of semigroups with infinitesimal generator given by an undirected graph Laplacian operator can be obtained through an understanding of the geometry of the underlying infinite weighted…
Similarity notions between vertices in a graph, such as structural and regular equivalence, are one of the main ingredients in clustering tools in complex network science. We generalise structural and regular equivalences for undirected…
Two graphs are said to be $Q$-cospectral if they share the same signless Laplacian spectrum. A simple graph is said to be determined by its signless Laplacian spectrum (abbreviated as DQS) if there exists no other non-isomorphic simple…
We propose a novel method to co-cluster the vertices and hyperedges of hypergraphs with edge-dependent vertex weights (EDVWs). In this hypergraph model, the contribution of every vertex to each of its incident hyperedges is represented…
Signed graphs have appeared in a broad variety of applications, ranging from social networks to biological networks, from distributed control and computation to power systems. In this paper, we investigate spectral properties of signed…
We consider the problem of finding universal bounds of "isoperimetric" or "isodiametric" type on the spectral gap of the Laplacian on a metric graph with natural boundary conditions at the vertices, in terms of various analytical and…
In this work, we define the Laplacian and Normalized Laplacian energies of vertices in a graph, we derive some of its properties and relate them to combinatorial, spectral and geometric quantities of the graph.
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 introduce a new operation on a class of graphs with the property that the Laplacian eigenvalues of the input and output graphs are related. Based on this operation, we obtain a family of order (square root of n) noncospectral unicyclic…
We construct isoperimetric regions from separating hypersurfaces in closed manifolds. This yields isoperimetric boundaries exhibiting a wide variety of topological types and singular sets.
We construct several new classes of isospectral manifolds with different local geometries. After reviewing a theorem by Carolyn Gordon on isospectral torus bundles and presenting certain useful specialized versions (Chapter 1) we apply…
We construct a surface that is obtained from the octahedron by pushing out 4 of the faces so that the curvature is supported in a copy of the Sierpinski gasket in each of them, and is essentially the self similar measure on SG. We then…
Recent spectral graph sparsification research allows constructing nearly-linear-sized subgraphs that can well preserve the spectral (structural) properties of the original graph, such as the first few eigenvalues and eigenvectors of the…
Stochastic waveforms are constructed whose expected autocorrelation can be made arbitrarily small outside the origin. These waveforms are unimodular and complex-valued. Waveforms with such spike like autocorrelation are desirable in…
We show that graphs, networks and other related discrete model systems carry a natural supersymmetric structure, which, apart from its conceptual importance as to possible physical applications, allows to derive a series of spectral…