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 …

The field of discrete calculus, also known as" discrete exterior calculus", focuses on finding a
proper set of definitions and differential operators that make it possible to operate the …

This is a survey of distance-regular graphs. We present an introduction to distance-regular
graphs for the reader who is unfamiliar with the subject, and then give an overview of some …

Written for mathematicians working with the theory of graph spectra, this (primarily
theoretical) book presents relevant results considering the spectral properties of regular …

To cope with the complexity of large networks, a number of dimensionality reduction
techniques for graphs have been developed. However, the extent to which information is lost …

We characterize the distance-regular Ivanov–Ivanov–Faradjev graph from the spectrum, and
construct cospectral graphs of the Johnson graphs, Doubled Odd graphs, Grassmann …

This paper concerns the study of observability in consensus networks modeled with strongly
regular graphs or distance regular graphs. We first give a Kalman-like simple algebraic …

Christandl et al. have noted that the d-dimensional hypercube can be projected to a linear
chain with d+ 1 sites so that, by considering fixed but different couplings between the qubits …

For a graph G, the first Zagreb index is defined as the sum of the squares of the vertices
degrees. By investigating the connection between the first Zagreb index and the first three …