On the existence of graphs of diameter two and defect two (Q1025938)
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 5569063
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the existence of graphs of diameter two and defect two |
scientific article; zbMATH DE number 5569063 |
Statements
On the existence of graphs of diameter two and defect two (English)
0 references
23 June 2009
0 references
A \((d,2,2)\)-graph is a \(n\)-vertex graph of maximum degree \(d\) and diameter 2 for which \(n=d^2-1\). Only 4 such graphs are known, two with \(d=3\) and one for \(d=4,5\) each. It is shown that irreducibility in \(\mathbb{Q}[x]\) of the characteristic polynomial of certain binary symmetric matrices depending on \(d>5\) implies nonexistence of a \((d,2,2)\)-graph, and such irreducibility is conjectured to always hold. Using the mathematics software PARI the conjecture has been verified for all \(d=6,\ldots,50\).
0 references
Moore bound
0 references
Defect
0 references
cycle graph
0 references
characteristic polynomial
0 references
irreducible
0 references
Gauss period
0 references
0.8605761528015137
0 references
0.8511295914649963
0 references
0.8287721872329712
0 references
0.8146376609802246
0 references
0.8121718168258667
0 references
