Siamese objects, and their relation to color graphs, association schemes and Steiner designs
type: Item
instance of: scholarly article
title: Siamese objects, and their relation to color graphs, association schemes and Steiner designs
zbMATH Open document ID: 1137.05072
author: Mikhail H. Klin
author: Sven Reichard
author: Andrew J. Woldar
published in: Bulletin of the Belgian Mathematical Society - Simon Stevin
publication date: 2008-02-22T00:00:00Z
review text: The authors generalize the work of \textit{H. Kharaghani} and \textit{R. Torabi} [Graphs Comb. 19, 519--526 (2003; Zbl 1032.05008)] and study a class of edge partitions, called \textit{Siamese color graphs}, and its connections to a class of association schemes, called \textit{Siamese}. A Siamese color graph is an edge partition \(\{S,R_1,\dots,R_k\}\) of the complete graph \((V,V^2)\) that satisfies the following properties: {\parindent=5mm \begin{itemize}\item[1.]\((V,S)\) is the disjoint union of cliques of equal size; \item[2.]each \((V,R_i)\) is an imprimitive distance regular graph of diameter 3 with the antipodal system determined by \(S\); \item[3.]each \((V,S\cup R_i)\) is a strongly regular graph. \end{itemize}} An association scheme with classes \(S_1,\dots,S_m,R_1,\dots,R_k\) is called Siamese if \(\{\cup_j S_j,R_1,\dots,R_k\}\) is a Siamese color graph. The authors investigate relations of these objects to classical geometries, such as projective spaces over finite fields, finite generalized quadrangles, and construct few explicit examples for small \(| V| \). A more detailed account of this work is to appear elsewhere.
Mathematics Subject Classification ID: 05E30
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 5239250
zbMATH Keywords: strongly regular graphs
zbMATH Keywords: generalized quadrangles
zbMATH Keywords: association schemes
zbMATH Keywords: decompositions of complete graphs
reviewed by: Dmitrii V. Pasechnik
describes a project that uses: nauty
MaRDI profile type: Publication
Recommended article: Q3656462
Recommended article: Q4204182
Recommended article: Current research on algebraic combinatorics. Supplements to our book, Algebraic combinatorics I
Recommended article: Self-orthogonal codes from equitable partitions of association schemes
Recommended article: On splitting the Clebsch graph
Recommended article: Partitioning strongly regular graphs
Recommended article: A characterization and hereditary properties for partition graphs
Recommended article: Recent examples in the theory of partition graphs
Recommended article: Q3695919
Recommended article: Strongly regular graphs with strongly regular decomposition
description: scientific article