No label defined (Q4530745)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1746576
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1746576 |
Statements
28 May 2002
0 references
regular graphs
0 references
valency of graphs
0 references
Moore inequality
0 references
Aschbacher graphs
0 references
automorphism groups
0 references
0.913340151309967
0 references
0.7698843479156494
0 references
0.7648508548736572
0 references
0.7584106922149658
0 references
0.7322813272476196
0 references
Let \(\Gamma\) be a regular graph of valency \(k\) and diameter \(d\). There is Moore's inequality on the number of vertices, \(v\leq 1+k+k(k-1)+\cdots+k(k-1)^{d-1}\) [see \textit{A.~J.~Hoffman} and \textit{R.~R.~Singleton}, IBM J. Res. Dev. 4, 497-504 (1960; Zbl 0096.38102)]. If \(v=1+k+k(k-1)+\dots+k(k-1)^{d-1}\) then \(\Gamma\) is called a Moore graph. There are many examples of Moore graphs for various numbers \(k\), but it is unknown whether a Moore graph of valency 57 exists. In the article these hypothetical graphs are called Aschbacher graphs. The authors prove a theorem on the structure of the group of automorphisms of an Aschbacher graph.
0 references