𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a graph of Hoffman and Singleton

✍ Scribed by C.T Benson; N.E Losey

Publisher
Elsevier Science
Year
1971
Tongue
English
Weight
520 KB
Volume
11
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A covering construction for packing disj
A covering construction for packing disjoint copies of the Hoffman-Singleton graph into K50
✍ Jana ŜiagiovΓ‘; Mariusz Meszka πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 92 KB

## Abstract In this note we show how coverings induced by voltage assignments can be used to produce packings of disjoint copies of the Hoffman‐Singleton graph into __K__~50~. Β© 2003 Wiley Periodicals, Inc. J Combin Designs 11: 408–412, 2003; Published online in Wiley InterScience (www.interscience

On the distance matrix of a directed gra
On the distance matrix of a directed graph
✍ 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 _