This book gives an elementary treatment of the basic material about graph spectra, both for
ordinary, and Laplace and Seidel spectra. The text progresses systematically, by covering …

Which graphs are determined by their spectrum? Page 1 Linear Algebra and its Applications
373 (2003) 241–272 www.elsevier.com/locate/laa Which graphs are determined by their …

We introduce a Laplacian and a signless Laplacian for the distance matrix of a connected
graph, called the distance Laplacian and distance signless Laplacian, respectively. We …

This open access book gives a systematic introduction into the spectral theory of differential
operators on metric graphs. Main focus is on the fundamental relations between the …

The distance Laplacian of a connected graph G is defined by L= Diag (Tr)-D, where D is the
distance matrix of G, and Diag (Tr) is the diagonal matrix whose main entries are the vertex …

The distance, distance Laplacian and distance signless Laplacian spectra of a connected
graph G are the spectra of the distance, distance Laplacian and distance signless Laplacian …

We present a geometrical construction of families of finite isospectral graphs labelled by
different partitions of a natural number r of given length s (the number of summands) …

In the area of image retrieval from data bases and for copyright protection of large image
collections there is a growing demand for unique but easily computable fingerprints for …

For any finite simple graph G=(V, E), the discrete Dirac operator D= d+ d* and the Laplace-
Beltrami operator L= dd*+ d* d on the exterior algebra bundle Omega are finite v times v …

In this paper a new class of isospectral graphs is presented. These graphs are isospectral
with respect to both the normalized Laplacian on the discrete graph and the standard …