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

Proof of a conjecture on the spectral radius of -free graphs

โœ Scribed by Mingqing Zhai; Bing Wang

Book ID
113772390
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
239 KB
Volume
437
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the spectral radius of graphs
On the spectral radius of graphs
โœ Aimei Yu; Mei Lu; Feng Tian ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 190 KB
Proof of a conjecture on irredundance pe
Proof of a conjecture on irredundance perfect graphs
โœ Lutz Volkmann; Vadim E. Zverovich ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 157 KB ๐Ÿ‘ 1 views

## Abstract Let __ir__(__G__) and ฮณ(__G__) be the irredundance number and the domination number of a graph __G__, respectively. A graph __G__ is called __irredundance perfect__ if __ir__(__H__)=ฮณ(__H__), for every induced subgraph __H__ of __G__. In this article we present a result which immediatel

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.