✦ LIBER ✦

Bounds on the spectral radius of graphs with e edges

✍ Scribed by Shmuel Friedland

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 298 KB
Volume: 101
Category: Article
ISSN: 0024-3795
DOI: 10.1016/0024-3795(88)90144-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A bound on the spectral radius of graphs

✍ Hong Yuan 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 238 KB

On the Spectral Radius of Graphs with Cu

On the Spectral Radius of Graphs with Cut Vertices

✍ Abraham Berman; Xiao-Dong Zhang 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 136 KB

A Sharp Upper Bound of the Spectral Radi

A Sharp Upper Bound of the Spectral Radius of Graphs

✍ Yuan Hong; Jin-Long Shu; Kunfu Fang 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 88 KB

The Spectral Radius of Graphs on Surface

The Spectral Radius of Graphs on Surfaces

✍ M.N. Ellingham; Xiaoya Zha 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 152 KB

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

Upper Bounds of the Spectral Radius of G

Upper Bounds of the Spectral Radius of Graphs in Terms of Genus

✍ Hong Yuan 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 149 KB

Let G be a simple graph with n vertices and orientable genus g and non-orientable genus h. Let \(G) be the spectral radius of the adjacency matrix A of G. We obtain the following sharp bounds of \(G): (1) \(G) 1+-3n+12g&8; (2) \(G) 1+-3n+6h&8.

On the spectral radius of a directed gra

On the spectral radius of a directed graph

✍ Kwapisz, Jaroslaw 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 314 KB 👁 2 views

We provide upper estimates on the spectral radius of a directed graph. In particular w e prove that the spectral radius is bounded by the maximum of the geometric mean of in-degree and out-degree taken over all vertices.