Graphs with the \(n\)-e.c. adjacency property constructed from resolvable designs (Q3578153)
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 5736277
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graphs with the \(n\)-e.c. adjacency property constructed from resolvable designs |
scientific article; zbMATH DE number 5736277 |
Statements
Graphs with the<i>n</i>-e.c. adjacency property constructed from resolvable designs (English)
0 references
13 July 2010
0 references
graphs
0 references
resolvable designs
0 references
adjacency properties
0 references
\(n\)-e.c. graphs
0 references
random graphs
0 references
Steiner 2-designs
0 references
affine planes
0 references
0.8760288953781128
0 references
0.8576153516769409
0 references
0.8521072268486023
0 references
0.8259823322296143
0 references
0.8213551044464111
0 references
