Campus Units
Mathematics
Document Type
Article
Publication Version
Published Version
Publication Date
1-2005
Journal or Book Title
Electronic Journal of Linear Algebra
Volume
14
First Page
12
Last Page
31
DOI
10.13001/1081-3810.1174
Abstract
Spectral Graph Theory is the study of the spectra of certain matrices defined from a given graph, including the adjacency matrix, the Laplacian matrix and other related matrices. Graph spectra have been studied extensively for more than fifty years. In the last fifteen years, interest has developed in the study of generalized Laplacian matrices of a graph, that is, real symmetric matrices with negative off-diagonal entries in the positions described by the edges of the graph ( and zero in every other off-diagonal position).
The set of all real symmetric matrices having nonzero off-diagonal entries exactly where the graph G has edges is denoted by S( G). Given a graph G, the problem of characterizing the possible spectra of B, such that B. S( G), has been referred to as the Inverse Eigenvalue Problem of a Graph. In the last fifteen years a number of papers on this problem have appeared, primarily concerning trees.
The adjacency matrix and Laplacian matrix of G and their normalized forms are all in S( G). Recent work on generalized Laplacians and Colin de Verdiere matrices is bringing the two areas closer together. This paper surveys results in Spectral Graph Theory and the Inverse Eigenvalue Problem of a Graph, examines the connections between these problems, and presents some new results on construction of a matrix of minimum rank for a given graph having a special form such as a 0,1-matrix or a generalized Laplacian.
Copyright Owner
The Author(s)
Copyright Date
2005
Language
en
File Format
application/pdf
Recommended Citation
Hogben, Leslie, "Spectral graph theory and the inverse eigenvalue problem of a graph" (2005). Mathematics Publications. 256.
https://lib.dr.iastate.edu/math_pubs/256
Comments
This article is published as Hogben, Leslie. "Spectral graph theory and the inverse eigenvalue problem of a graph." The Electronic Journal of Linear Algebra 14 (2005): 12-31. DOI: 10.13001/1081-3810.1174. Posted with permission.