A covering construction for packing disjoint copies of the Hoffman‐Singleton graph into K 50
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.wiley.com ). DO...
Gespeichert in:
| Veröffentlicht in: | Journal of combinatorial designs 2003-01, Vol.11 (6), p.408-412 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | 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.wiley.com
). DOI 10.1002/jcd.10049 |
|---|---|
| ISSN: | 1063-8539 1520-6610 |
| DOI: | 10.1002/jcd.10049 |