Presuperschemes and colored directed graphs (Q2747177)
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: Presuperschemes and colored directed graphs |
scientific article; zbMATH DE number 1657296
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Presuperschemes and colored directed graphs |
scientific article; zbMATH DE number 1657296 |
Statements
4 December 2001
0 references
association schemes
0 references
colored directed graphs
0 references
strongly regular graphs
0 references
presuperscheme
0 references
Presuperschemes and colored directed graphs (English)
0 references
A colored directed graph is called strongly regular if it satisfies the 3-vertex condition. If the scheme associated with a colored directed graph is an association scheme, then the graph is strongly regular (Faradzev, Klin, Muzichuk). In this paper presuperschemes associated with graphs are determined. The main result is Theorem 4.4: If a presuperscheme associated with a graph has \(t\) levels, then the graph satisfies the \((t+3)\)-vertex condition.
0 references
