Inertia Sets For Families of Graphs
From MaRDI portal
Publication:6267232
arXiv1511.02520MaRDI QIDQ6267232FDOQ6267232
Authors: E. B. Cohen, N. H. Nguyen, J. G. Winde, Amy Yielding 
Publication date: 8 November 2015
Abstract: This paper consists of a few results, discovered and proved during the 2012-2013 research group at Eastern Oregon University. Inertia tables are a visual representation of the possible inertias of a given graph. The inertia of a graph counts the number of real positive and negative eigenvalues of its corresponding adjacency matrix. The problem of studying inertia tables is directly related to the inverse eigenvalue problem and can be used as a tool for the minimum rank problem. This paper describes the inverse eigenvalue problem, and tools used. We describe a number of new general formulas for various simple undirected graphs and improved upon an established notation for inertia tables.
This page was built for publication: Inertia Sets For Families of Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6267232)
