• Tidak ada hasil yang ditemukan

abs_vol18_pp442-461. 26KB Jun 04 2011 12:05:47 AM

N/A
N/A
Protected

Academic year: 2017

Membagikan "abs_vol18_pp442-461. 26KB Jun 04 2011 12:05:47 AM"

Copied!
1
0
0

Teks penuh

(1)

ELA

ON THE INVERSE EIGENVALUE PROBLEMS: THE CASE OF

SUPERSTARS

ROS ´ARIO FERNANDES†

Abstract. Let T be a tree and letx0 be a vertex ofT. T is called a superstar with central

vertexx0ifTx0is a union of paths. The General Inverse Eigenvalue Problem for certain trees is

partially answered. Using this description, some superstars are presented for which the problem of ordered multiplicity lists and the Inverse Eigenvalue Problem are not equivalent.

Key words. Eigenvalues, Tree, Graph, Symmetric matrices.

AMS subject classifications.15A18, 05C38, 05C50.

Received by the editors September 16, 2007. Accepted for publication July 27, 2009. Handling

Editor: Stephen J. Kirkland.

Departamento de Matem´atica, Faculdade de Ciˆencias e Tecnologia, Universidade Nova de Lisboa,

Quinta da Torre, 2829-516 Caparica, Portugal ([email protected]). This research was done within the activities of “Centro de Estruturas Lineares e Combinat´orias”.

Electronic Journal of Linear Algebra ISSN 1081-3810 A publication of the International Linear Algebra Society Volume 18, pp. 442-461, August 2009

Referensi

Dokumen terkait

In this paper the structure of the zero minors of totally positive matrices is studied and applications are presented..

Discrete p -Laplacian, Largest eigenvalue, Eigenvector, Tree, Degree

Applying the full rank factorization in echelon form the Flanders theorem and its converse in a particular case are proven..

Stochastic and doubly stochastic matrices are also constructed with a given spectrum and with any legitimately prescribed elementary divisors..

In this paper, some necessary and sufficient con- ditions for the existence of the group inverse for square matrix over R are given, the conditions for the existence of the

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..

A key tool to obtain these bounds is using some Hermitian matrices which are, in the sense of Loewner matrix ordering, below the Hermitian part of A or, more generally, below

This paper surveys results in Spectral Graph Theory and the Inverse Eigenvalue Problem of a Graph, examines the connections between these problems, and presents some new results