✦ LIBER ✦

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

✍ Scribed by Hong Yuan

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 149 KB
Volume: 74
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1998.1837

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

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

On the Spectral Radius and the Genus of

On the Spectral Radius and the Genus of Graphs

✍ H. Yuan 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 205 KB

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

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

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.

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

New upper bounds on the decomposability

New upper bounds on the decomposability of planar graphs

✍ Fedor V. Fomin; Dimitrios M. Thilikos 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 335 KB 👁 1 views

## Abstract It is known that a planar graph on __n__ vertices has branch‐width/tree‐width bounded by $\alpha \sqrt {n}$. In many algorithmic applications, it is useful to have a small bound on the constant α. We give a proof of the best, so far, upper bound for the constant α. In particular, for th