# The Inverse Inertia Problem for Graphs

@inproceedings{Barrett2007TheII, title={The Inverse Inertia Problem for Graphs}, author={Wayne Barrett and H. Tracy Hall and Raphael Loewy}, year={2007} }

- Published 2007

Let G be an undirected graph on n vertices and let S(G) be the set of all real symmetric n × 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… CONTINUE READING

#### Citations

##### Publications citing this paper.

## Variants on the minimum rank problem: A survey II

VIEW 11 EXCERPTS

CITES BACKGROUND

HIGHLY INFLUENCED

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 16 REFERENCES

## Linear and Multilinear Algebra

VIEW 5 EXCERPTS

HIGHLY INFLUENTIAL

## Digraphs and Sign Patterns

VIEW 1 EXCERPT

## Masters Thesis

VIEW 2 EXCERPTS

## Toughness in Graphs – A Survey

VIEW 1 EXCERPT

## in Handbook of Linear Algebra

## Electronic Journal of Linear Algebra

## eigenvalue multiplicities

VIEW 1 EXCERPT