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

Homology of the line graph and of related graph-valued functions

โœ Scribed by Erich Prisner

Book ID
112496883
Publisher
Springer
Year
1991
Tongue
English
Weight
305 KB
Volume
56
Category
Article
ISSN
0003-889X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Cycle systems of the line graph of the c
Cycle systems of the line graph of the complete graph
โœ Cox, B.A.; Rodger, C.A. ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 562 KB

For all m = 0 (mod 41, for all n = 0 or 2 (mod m), and for all n = 1 (mod 2m) w e find an m-cycle decomposition of the line graph of the complete graph K,. In particular, this solves the existence problem when m is a power of two.

The spectral radii of a graph and its li
The spectral radii of a graph and its line graph
โœ Lingsheng Shi ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 150 KB

The spectral radius of a (directed) graph is the largest eigenvalue of adjacency matrix of the (directed) graph. We give the relation on the characteristic polynomials of a directed graph and its line graph, and obtain sharp bounds on the spectral radius of directed graphs. We also give the relation