On completely regular codes with minimum eigenvalue in geometric graphs (Q6041848)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On completely regular codes with minimum eigenvalue in geometric graphs |
scientific article; zbMATH DE number 7686166
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On completely regular codes with minimum eigenvalue in geometric graphs |
scientific article; zbMATH DE number 7686166 |
Statements
On completely regular codes with minimum eigenvalue in geometric graphs (English)
0 references
15 May 2023
0 references
completely regular code
0 references
geometric graph
0 references
Delsarte clique
0 references
\(t\)-design
0 references
reconstruction
0 references
Johnson graph
0 references
0.8377324938774109
0 references
0.8260617852210999
0 references
0.8137897253036499
0 references
0.8039822578430176
0 references
