The inverse inertia problem for graphs
From MaRDI portal
Publication:6207541
arXiv0711.3049MaRDI QIDQ6207541FDOQ6207541
Authors: Wayne Barrett, H. Tracy Hall, Raphael Loewy 
Publication date: 19 November 2007
Abstract: Let G be an undirected graph on n vertices and let S(G) be the set of all real symmetric n x n matrices whose nonzero off-diagonal entries occur in exactly the positions corresponding to the edges of G. The inverse inertia problem for G asks which inertias can be attained by a matrix in S(G). We give a complete answer to this question for trees in terms of a new family of graph parameters, the maximal disconnection numbers of a graph. We also give a formula for the inertia set of a graph with a cut vertex in terms of inertia sets of proper subgraphs. Finally, we give an example of a graph that is not inertia-balanced, and investigate restrictions on the inertia set of any graph.
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Vector spaces, linear dependence, rank, lineability (15A03)
This page was built for publication: The inverse inertia problem for graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6207541)
