#### Document Type

Article

#### Department/Program

Mathematics

#### Pub Date

1-2-2017

#### Publisher

SPECIAL MATRICES

#### Volume

5

#### Issue

1

#### Abstract

We take as given a real symmetric matrix A, whose graph is a tree T, and the eigenvalues of A, with their multiplicities. Each edge of T may then be classified in one of four categories, based upon the change in multiplicity of a particular eigenvalue, when the edge is removed (i.e. the corresponding entry of A is replaced by 0). We show a necessary and suffcient condition for each possible classification of an edge. A special relationship is observed among 2-Parter edges, Parter edges and singly Parter vertices. Then, we investigate the change in multiplicity of an eigenvalue based upon a change in an edge value. We show how the multiplicity of the eigenvalue changes depending upon the status of the edge and the edge value. This work explains why, in some cases, edge values have no effect on multiplicities. We also characterize, more precisely, how multiplicity changes with the removal of two adjacent vertices.

#### Recommended Citation

Toyonaga, Kenji and Johnson, Charles R., The classification of edges and the change in multiplicity of an eigenvalue of a real symmetric matrix resulting from the change in an edge value (2017).

10.1515/spma-2017-0004

#### DOI

10.1515/spma-2017-0004