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

On the linegraph of a directed graph

โœ Scribed by Martin Aigner


Book ID
105075632
Publisher
Springer-Verlag
Year
1967
Tongue
French
Weight
306 KB
Volume
102
Category
Article
ISSN
0025-5874

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


On the cycle polytope of a directed grap
โœ Egon Balas; Maarten Oosten ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 185 KB ๐Ÿ‘ 2 views
On the spectral radius of a directed gra
โœ 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 distance matrix of a directed gra
โœ R. L. Graham; A. J. Hoffman; H. Hosoya ๐Ÿ“‚ Article ๐Ÿ“… 1977 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 144 KB ๐Ÿ‘ 2 views

## Abstract In this note, we show how the determinant of the distance matrix __D(G__) of a weighted, directed graph __G__ can be explicitly expressed in terms of the corresponding determinants for the (strong) blocks __G~i~__ of __G__. In particular, when cof __D(G__), the sum of the cofactors of _

Subharmonic functions on a directed grap
โœ Yu. I. Lyubich; M. I. Tabachnikov ๐Ÿ“‚ Article ๐Ÿ“… 1970 ๐Ÿ› SP MAIK Nauka/Interperiodica ๐ŸŒ English โš– 825 KB