A Note on the McKay–Miller–Širáň Graphs

McKay, Miller, and Širáň (1998, J. Combin. Theory Ser. B74 (1), 110–118) constructed a family of the currently largest known vertex-transitive graphs of degree d, diameter 2, and order 89(d+12)2, for infinitely many values of d. We present a simplified construction of their graphs.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of combinatorial theory. Series B 2001-03, Vol.81 (2), p.205-208
1. Verfasser: Šiagiová, Jana
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:McKay, Miller, and Širáň (1998, J. Combin. Theory Ser. B74 (1), 110–118) constructed a family of the currently largest known vertex-transitive graphs of degree d, diameter 2, and order 89(d+12)2, for infinitely many values of d. We present a simplified construction of their graphs.
ISSN:0095-8956
1096-0902
DOI:10.1006/jctb.2000.2006