The inverse inertia problem for the complements of partial kk-trees

preprint2012arXivOpen access

Abstract

Let F\mathbb{F} be an infinite field with characteristic different from two. For a graph G=(V,E)G=(V,E) with V=1,...,nV={1,...,n}, let S(G;F)S(G;\mathbb{F}) be the set of all symmetric n×nn\times n matrices A=[ai,j]A=[a_{i,j}] over F\mathbb{F} with ai,j≠0a_{i,j}\not=0, i≠ji\not=j if and only if ij∈Eij\in E. We show that if GG is the complement of a partial kk-tree and m≥k+2m\geq k+2, then for all nonsingular symmetric m×mm\times m matrices KK over F\mathbb{F}, there exists an m×nm\times n matrix UU such that UTKU∈S(G;F)U^T K U\in S(G;\mathbb{F}). As a corollary we obtain that, if k+2≤m≤nk+2\leq m\leq n and GG is the complement of a partial kk-tree, then for any two nonnegative integers pp and qq with p+q=mp+q=m, there exists a matrix in S(G;R)S(G;\reals) with pp positive and qq negative eigenvalues.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.