Presentation
The Inverse Eigenvalue Problem of a Graph
Mathematics Conference Papers, Posters and Presentations
Document Type
Report
Disciplines
Conference
Banff International Research Station: The Inverse Eigenvalue Problem of a Graph
Publication Version
Published Version
Link to Published Version
http://www.birs.ca/events/2016/focussed-research-groups/16frg677
Publication Date
1-1-2016
Conference Title
Banff International Research Station: The Inverse Eigenvalue Problem of a Graph
Conference Date
June 5-12, 2016
Geolocation
(51.1783629, -115.57076940000002)
Abstract
Inverse eigenvalue problems appear in various contexts throughout mathematics and engineering, and refer to determining all possible lists of eigenvalues (spectra) for matrices fitting some description. The inverse eigenvalue problem of a graph refers to determining the possible spectra of real symmetric matrices whose pattern of nonzero off-diagonal entries is described by the edges of a given graph (precise definitions of this and other terms are given in the next paragraph). This problem and related variants have been of interest for many years and were originally approached through the study of ordered multiplicity lists.
Copyright Owner
Banff International Research Station
Copyright Date
2016
Language
en
File Format
application/pdf
Citation Information
Wayne Barrett, Steve Butler, Shaun Fallat, H. Tracy Hall, et al.. "The Inverse Eigenvalue Problem of a Graph" Banff, Alberta, CA(2016) Available at: http://works.bepress.com/leslie-hogben/77/
This report resulted from the Banff International Research Station Focused Research Groups and is published as Barrett, Wayne, Steve Butler, Shaun Fallat, H. Tracy Hall, Leslie Hogben, Jephian CH Lin, Bryan Shader, and Michael Young. "The inverse eigenvalue problem of a graph." Banff International Research Station: The Inverse Eigenvalue Problem of a Graph, 2016. Posted with permission.