  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.
