An inextensible association scheme associated with a 4-regular graph (Q5936103)
From MaRDI portal
scientific article; zbMATH DE number 1612997
Language | Label | Description | Also known as |
---|---|---|---|
English | An inextensible association scheme associated with a 4-regular graph |
scientific article; zbMATH DE number 1612997 |
Statements
An inextensible association scheme associated with a 4-regular graph (English)
0 references
14 May 2002
0 references
It is known that the scheme associated with a graph is an association scheme iff the graph is strongly regular. Consider the problem of extending such an association scheme to a superscheme in the case of a coloured, directed graph. If a presuperscheme associated with a graph is of height \(t\), then the graph satisfies the \((t+3)\)-vertex condition. This paper shows that the reverse conclusion does not hold. It provides an example of a coloured, directed graph which satisfies the 4-vertex condition, but whose presuperscheme cannot be extended beyond the bottom (\(0\)-th) level. In particular, the example exhibits an association scheme that cannot be extended to a presuperscheme of positive height.
0 references
4-regular graph
0 references
permutation group scheme
0 references
association scheme
0 references
strongly regular
0 references
presuperscheme
0 references