Siamese combinatorial objects via computer algebra experimentation

MaRDI QIDQ3656462zbMATH OpenFDO

Authors Sven Reichard, Andrew J. Woldar, Mikhail H. Klin

Publication date 13 January 2010

zbMATH Keywords

strongly regular graphassociation schemedistance regular graphspreadgeneralized quadrangleSteiner systemcoherent configurationcomputer algebra packagecolor graphSiamese association schemeSiamese color graphSiamese Steiner design

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Combinatorial aspects of block designs (05B05) Association schemes, strongly regular graphs (05E30) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Siamese objects, and their relation to color graphs, association schemes and Steiner designs
• A series of Siamese twin designs
• Using algebraic properties of minimal idempotents for exhaustive computer generation of association schemes
• A class of Siamese twin Menon designs
• scientific article; zbMATH DE number 782055

Cited in

(5)

• Links between two semisymmetric graphs on 112 vertices via association schemes
• Siamese objects, and their relation to color graphs, association schemes and Steiner designs
• Association schemes on 28 points as mergings of a half-homogeneous coherent configuration
• On the existence of self-complementary and non-self-complementary strongly regular graphs with Paley parameters
• The Paulus-Rozenfeld-Thompson graph on 26 vertices revisited and related combinatorial structures

Describes a project that uses

Uses Software

• GRAPE
• DISCRETA
• nauty

This page was built for publication: Siamese combinatorial objects via computer algebra experimentation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3656462)