The inverse inertia problem for graphs

Details The inverse inertia problem for graphs The inverse inertia problem for graphs

2007-11-20

arxiv.org/abs/0711.3049v1

Mathematics

Combinatorics

83 pages, 15 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The inverse inertia problem for graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The inverse inertia problem for graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The inverse inertia problem for graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-391528