Search

The normalized distance Laplacian of a graph G is defined as D L (G) = T (G) − 1 / 2 (T (G) − D (G)) T (G) − 1 / 2 where D (G) is the matrix with pairwise distances between vertices and T (G) is the diagonal transmission matrix. In this project, we study the minimum and maximum spectral radii associated with this matrix, and the structures of the graphs that achieve these values. In particular, we prove a conjecture of Reinhart that the complete graph is the unique graph with minimum spectral radius, and we give several partial results towards a second conjecture of Reinhart regarding which graph has the maximum spectral radius. [ABSTRACT FROM AUTHOR]

Let 0 < ρ ≤ 2 and w ρ (X) be the operator radius of a bounded linear Hilbert space operator X. In this paper we present characterizations of operators satisfying w ρ (X) ≤ 1. We also give an expression for the ρ -radii based on the numerical radius of a certain 2 × 2 block matrix. This enables us to investigate the properties of the operator radii w ρ (⋅). In particular, we obtain lower and upper bounds for the operator radii. In addition, we define a norm on Hilbert space operators, which generalizes the operator radii and prove some basic properties of this norm. Our results extend or improve some theorems due to Ando [4] , Bhatia–Jain [9] and Kittaneh [19]. [ABSTRACT FROM AUTHOR]