• Tidak ada hasil yang ditemukan

abs_vol20_pp53-78. 29KB Jun 04 2011 12:05:48 AM

N/A
N/A
Protected

Academic year: 2017

Membagikan "abs_vol20_pp53-78. 29KB Jun 04 2011 12:05:48 AM"

Copied!
1
0
0

Teks penuh

(1)

ELA

INERTIA SETS FOR GRAPHS ON SIX OR FEWER VERTICES

WAYNE BARRETT†, CAMILLE JEPSEN, ROBERT LANG§, EMILY MCHENRY,

CURTIS NELSON‡, AND KAYLA OWENSk

Abstract. LetGbe an undirected graph onnvertices and letS(G) be the set of all real sym-metricn×nmatrices whose nonzero off-diagonal entries occur in exactly the positions corresponding to the edges ofG. The inverse inertia problem forGasks which inertias can be attained by a matrix inS(G), a question which was previously answered whenGis a tree. In this paper, a number of new techniques are developed in order to be able to determine possible inertias of general graphs: covers with cliques, covers with cliques and clique-stars, and the graph operations of edge subdivision, edge deletion, joins, and unions. Because most of the associated theorems require additional hypotheses, definitive criteria that apply to all graphs cannot be provided. Nevertheless, these results are strong enough to be able to determine the inertia set of each graph on 6 or fewer vertices and can be applied to many graphs with larger order as well. One consequence of the 1– 6 vertex results is the fact that all of these graphs have balanced inertia. It is also mentioned which of these results guarantee or preserve balanced inertia, and explain how to modify them to include Hermitian matrices.

Key words. Balanced inertia, Combinatorial matrix theory, Graph, Hermitian, Inertia, Inverse inertia problem, Minimum rank, Symmetric.

AMS subject classifications. 05C05, 05C50, 15A03, 15A57.

Received by the editors July 31, 2009. Accepted for publication December 20, 2009. Handling

Editor: Richard A. Brualdi. This research was conducted during the summer of 2009 as part of the Brigham Young University REU program and was supported by NSF grant DMS-0755422.

Department of Mathematics, Brigham Young University, Provo, Utah 84602, United States

([email protected]).

Undergraduates, Brigham Young University, Provo, Utah, 84602 ([email protected],

[email protected]).

§Undergraduate, Florida Atlantic University, 777 Glades Rd, Boca Raton, FL 33431

([email protected]).

Undergraduate, Xavier University, 3800 Victory Parkway, Cincinnati, Ohio 45207

([email protected]).

kMasters Degree, Brigham Young University ([email protected]).

Electronic Journal of Linear Algebra ISSN 1081-3810 A publication of the International Linear Algebra Society Volume 20, pp. 53-78, January 2010

Referensi

Dokumen terkait

Moreover, the minimum (resp. maximum) number of edges for all (connected) graphs with pendent vertices and nullity η are determined, and the extremal graphs are characterized..

Laplacian matrix, Algebraic connectivity, Caterpillar, Bottleneck matrices, Perron branches, Characteristic vertices.. AMS

arbitrary pendent vertex of the star) is the unique tree that maximizes the distance spectral radius, and conjecture the structure of a tree which minimizes the distance

Sign pattern matrix, Spectrally arbitrary pattern, Inertially arbitrary pattern, Tree sign pattern, Potentially nilpotent pattern, Potentially stable pattern, Gr¨ obner basis..

† Departamento de Matem´ aticas, Universidad Cat´ olica del Norte, Casilla 1280, Antofagasta, Chile..

Moreover, the minimum (resp. maximum) number of edges for all (connected) graphs with pendent vertices and nullity η are determined, and the extremal graphs are characterized..

In [6], the author characterized the extremal graph of bicyclic graphs with k pendant vertices with maximal signless Laplacian spectral radius2. For further details, we refer the

In Section 3, we show that the birth-and-assassination process is the scaling limit, as n goes to infin- ity, of the rumor scotching process when G is the complete graph over n