✦ LIBER ✦

On the spectral radius of a directed graph

✍ Scribed by Kwapisz, Jaroslaw

Publisher: John Wiley and Sons
Year: 1996
Tongue: English
Weight: 314 KB
Volume: 23
Category: Article
ISSN: 0364-9024
DOI: 10.1002/(sici)1097-0118(199612)23:4<405::aid-jgt9>3.0.co;2-v

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

On the cycle polytope of a directed grap

On the cycle polytope of a directed graph

✍ Egon Balas; Maarten Oosten 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 185 KB 👁 1 views

On Lipschitz continuity of the joint spe

On Lipschitz continuity of the joint spectral radius

✍ F. Wirth 📂 Article 📅 2002 🏛 John Wiley and Sons ⚖ 77 KB 👁 1 views

Iterating the branching operation on a d

Iterating the branching operation on a directed graph

✍ Athanasiadis, Christos A. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB 👁 2 views

The branching operation D, defined by Propp, assigns to any directed graph G another directed graph D(G) whose vertices are the oriented rooted spanning trees of the original graph G. We characterize the directed graphs G for which the sequence δ(G) = (G, D(G), D 2 (G), . . .) converges, meaning tha

A matrix method for location of cycles o

A matrix method for location of cycles of a directed graph

✍ R. L. Norman 📂 Article 📅 1965 🏛 American Institute of Chemical Engineers 🌐 English ⚖ 269 KB 👁 1 views

A note on mixed graphs and directed spli

A note on mixed graphs and directed splitting off

✍ Enni, Steffen 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 329 KB 👁 2 views

We give counterexamples to two conjectures of Bill Jackson in Some remarks on arc-connectivity, vertex splitting, and orientation in graphs and digraphs (Journal of Graph Theory 12(3):429-436, 1988) concerning orientations of mixed graphs and splitting off in digraphs, and prove the first conjecture

On 2-factors of a bipartite graph

✍ Wang, Hong 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 191 KB 👁 2 views

In this article, we consider the following problem: Given a bipartite graph G and a positive integer k, when does G have a 2-factor with exactly k components? We will prove that if , then, for any bipartite graph H = (U 1 , U 2 ; F ) with |U 1 | ≤ n, |U 2 | ≤ n and ∆(H) ≤ 2, G contains a subgraph i