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
โฆ LIBER โฆ
On the bore radius for minimal surfaces
โ Scribed by V. G. Tkachev
- Publisher
- SP MAIK Nauka/Interperiodica
- Year
- 1996
- Tongue
- English
- Weight
- 235 KB
- Volume
- 59
- Category
- Article
- ISSN
- 0001-4346
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
The Spectral Radius of Graphs on Surface
โ
M.N. Ellingham; Xiaoya Zha
๐
Article
๐
2000
๐
Elsevier Science
๐
English
โ 152 KB
The uniqueness for minimal surfaces inS3
โ
Miyuki Koiso
๐
Article
๐
1989
๐
Springer
๐
English
โ 626 KB
The Laplacian spectral radius of graphs
โ
Liang Lin
๐
Article
๐
2008
๐
Elsevier Science
๐
English
โ 89 KB
Let G be an n-vertex (n 3) simple graph embeddable on a surface of Euler genus ฮณ (the number of crosscaps plus twice the number of handles). Denote by the maximum degree of G. In this paper, we first present two upper bounds on the Laplacian spectral radius of G as follows: (i) (ii) If G is 4-conn
On a free boundary problem for minimal s
โ
M. Struwe
๐
Article
๐
1984
๐
Springer-Verlag
๐
English
โ 621 KB
The strong halfspace theorem for minimal
โ
D. Hoffman; W. H. Meeks
๐
Article
๐
1990
๐
Springer-Verlag
๐
English
โ 275 KB
The bridge principle for stable minimal
โ
Brian White
๐
Article
๐
1994
๐
Springer
๐
English
โ 1016 KB