๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An extremal problem for the spectral radius of a graph

โœ Scribed by Miroslav Fiedler

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
519 KB
Volume
108
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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.

Minimizer graphs for a class of extremal
Minimizer graphs for a class of extremal problems
โœ Dan Ismailescu; Dan Stefanica ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 93 KB ๐Ÿ‘ 2 views

## Abstract We consider the family of graphs with a fixed number of vertices and edges. Among all these graphs, we are looking for those minimizing the sum of the square roots of the vertex degrees. We prove that there is a unique such graph, which consists of the largest possible complete subgraph

An upper bound for the radius of a 3-con
An upper bound for the radius of a 3-connected graph
โœ Jochen Harant ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 286 KB

For a 3-connected graph with radius r containing n vertices, in [1] r < n/4 + O(log n) was proved and r < n/4 + const was conjectured. Here we prove r < n/4 + 8. Let G be a simple 3-connected finite graph on n vertices with vertex set V(G) and edge set E(G). For X, YE V(G) we denote by d(X, Y) the