Graphs with the<i>n</i>-e.c. adjacency property constructed from resolvable designs (Q3578153): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:38, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graphs with the<i>n</i>-e.c. adjacency property constructed from resolvable designs |
scientific article |
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
