Directed strongly regular graphs obtained from coherent algebras

DOI10.1016/j.laa.2003.06.020zbMath1030.05119OpenAlexW2066687211MaRDI QIDQ1418969

Paul-Hermann Zieschang, Akihiro Munemasa, Mikhail E. Muzychuk, Mikhail H. Klin

Publication date: 14 January 2004

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2003.06.020

zbMATH Keywords

Steiner systemDihedral groupAutomorphism groupPermutation groupBuildingDirected strongly regular graphCoherent algebraDoubly regular tournamentFlag algebra

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Association schemes, strongly regular graphs (05E30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (25)

The application of representation theory in directed strongly regular graphs ⋮ New partial geometric difference sets and partial geometric difference families ⋮ \(g\)-circulant solutions to the (0,1) matrix equation \(A^m=J_n\) ⋮ Representations of directed strongly regular graphs ⋮ Directed strongly regular Cayley graphs on dihedral groups ⋮ New tools for the construction of directed strongly regular graphs: difference digraphs and partial sum families ⋮ New mixed Moore graphs and directed strongly regular graphs ⋮ A Family of Partial Geometric Designs from Three-Class Association Schemes ⋮ Edge connectivity in difference graphs and some new constructions of partial sum families ⋮ On symmetric association schemes and associated quotient-polynomial graphs ⋮ Partial sum quadruples and bi-abelian digraphs ⋮ Two kinds of constructions of directed strongly regular graphs ⋮ The Paulus–Rozenfeld–Thompson Graph on 26 Vertices Revisited and Related Combinatorial Structures ⋮ Some families of directed strongly regular graphs obtained from certain finite incidence structures ⋮ New feasibility conditions for directed strongly regular graphs ⋮ Equiangular tight frames from complex Seidel matrices containing cube roots of unity ⋮ TABLE ALGEBRAS OF RANK 3 AND ITS APPLICATIONS TO STRONGLY REGULAR GRAPHS ⋮ Infinite families of directed strongly regular graphs using equitable partitions ⋮ Spectral theory of products of digraphs ⋮ Constructions of \(1\frac{1}{2}\)-designs from symplectic geometry over finite fields ⋮ Some constructions of quasi-strongly regular digraphs ⋮ Cayley digraphs with normal adjacency matrices ⋮ Directed strongly regular graphs with rank 5 ⋮ Weighted association schemes, fusions, and minimal coherent closures ⋮ Homogeneous coherent configurations from spherical buildings and other edge-coloured graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On finite geometries of type \(B_ 3\)
• Coherent algebras
• A directed graph version of strongly regular graphs
• Tactical configurations and their generic ring
• Galois correspondence between permutation groups and cellular rings (association schemes)
• Strongly regular graphs
• Coherent configurations. I: Ordinary representation theory
• On construction and identification of graphs. With contributions by A. Lehman, G. M. Adelson-Velsky, V. Arlazarov, I. Faragev, A. Uskov, I. Zuev, M. Rosenfeld and B. Weisfeiler
• Problems in algebraic combinatorics
• Coherent configurations. I
• On the theorem of Feit-Higman
• Flag algebras of symmetric design
• Non-existence of directed strongly regular graphs
• Homogeneous coherent configurations as generalized groups and their relationship to buildings
• An algebraic approach to association schemes
• The nonexistence of certain generalized polygons
• Doubly regular tournaments are equivalent to skew Hadamard matrices
• Strongly regular graphs, partial geometries and partially balanced designs
• Finite permutation groups of rank 3
• Zur Theorie der einfach transitiven Permutationsgruppen. II
• The Finite Primitive Permutation Groups of Rank Three
• On the Polynomial of a Graph

This page was built for publication: Directed strongly regular graphs obtained from coherent algebras