We prove the `p-spectral radius formula for n-tuples of commuting Banach algebra elements. This generalizes results of [6], [7] and [10]. Let A be a Banach algebra with the unit element denoted by 1. Let a = (a1, . . . , an) be an n-tuple of elements of A. Denote by σ(a) the Harte spectrum of a, i.e. λ = (λ1, . . . , λn) / ∈ σ(a) if and only if there exist u1, . . . , un, v1, . . . , vn ∈ A suc...

In this paper, we study some extremal problems of three kinds of spectral radii of k-uniform hypergraphs (the adjacency spectral radius, the signless Laplacian spectral radius and the incidence Q-spectral radius). We call a connected and acyclic k-uniform hypergraph a supertree. We introduce the operation of “moving edges” for hypergraphs, together with the two special cases of this operation: ...

The structure of graphs whose largest eigenvalue is bounded by 3 2 √ 2 (≈ 2.1312) is investigated. In particular, such a graph can have at most one circuit, and has a natural quipu structure.

Write (A) = 1 (A) min (A) for the eigenvalues of a Hermitian matrix A. Our main result is: let A be a Hermitian matrix partitioned into r r blocks so that all diagonal blocks are zero. Then for every real diagonal matrix B of the same size as A; (B A) B + 1 r 1 : Let G be a nonempty graph, (G) be its chromatic number, A be its adjacency matrix, and L be its Laplacian. The above inequality impli...

Let η(G) denote the distance signless Laplacian spectral radius of a connected graph G. In this paper, bounds for the distance signless Laplacian spectral radius of connected graphs are given, and the extremal graph with the minimal distance signless Laplacian spectral radius among the graphs with given vertex connectivity and minimum degree is determined. Furthermore, the digraph that minimize...