On the higher numerical radius and spectral norm
โ Scribed by Chi-Kwong Li
- Publisher
- Elsevier Science
- Year
- 1986
- Tongue
- English
- Weight
- 584 KB
- Volume
- 80
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
In this paper, we obtain a relation between the spectral radius and the genus of a graph. In particular, we give upper bounds on the spectral radius of graphs with \(n\) vertices and small genus. " " 1995 Academic Press. Ins
## Abstract In this paper we continue to study the spectral norms and their completions ([4]) in the case of the algebraic closure \documentclass{article} \usepackage{amssymb} \pagestyle{empty} \begin{document} $ \overline {\mathbb Q} $ \end{document} of โ in โ. Let \documentclass{article} \usepack
This paper provides new upper bounds on the spectral radius \ (largest eigenvalue of the adjacency matrix) of graphs embeddable on a given compact surface. Our method is to bound the maximum rowsum in a polynomial of the adjacency matrix, using simple consequences of Euler's formula. Let # denote th