Displaying 81 – 100 of 193

Showing per page

The maximum multiplicity and the two largest multiplicities of eigenvalues in a Hermitian matrix whose graph is a tree

Rosário Fernandes (2015)

Special Matrices

The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree, M1, was understood fully (froma combinatorial perspective) by C.R. Johnson, A. Leal-Duarte (Linear Algebra and Multilinear Algebra 46 (1999) 139-144). Among the possible multiplicity lists for the eigenvalues of Hermitian matrices whose graph is a tree, we focus upon M2, the maximum value of the sum of the two largest multiplicities when the largest multiplicity is M1. Upper and lower bounds are given for M2. Using a combinatorial...

The minimum, diagonal element of a positive matrix

M. Smyth, T. West (1998)

Studia Mathematica

Properties of the minimum diagonal element of a positive matrix are exploited to obtain new bounds on the eigenvalues thus exhibiting a spectral bias along the positive real axis familiar in Perron-Frobenius theory.

The Minimum Spectral Radius of Signless Laplacian of Graphs with a Given Clique Number

Li Su, Hong-Hai Li, Jing Zhang (2014)

Discussiones Mathematicae Graph Theory

In this paper we observe that the minimal signless Laplacian spectral radius is obtained uniquely at the kite graph PKn−ω,ω among all connected graphs with n vertices and clique number ω. In addition, we show that the spectral radius μ of PKm,ω (m ≥ 1) satisfies [...] More precisely, for m > 1, μ satisfies the equation [...] where [...] and [...] . At last the spectral radius μ(PK∞,ω) of the infinite graph PK∞,ω is also discussed.

Currently displaying 81 – 100 of 193