A note on a family of directed strongly regular graphs (Q1970076): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2037231253 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A directed graph version of strongly regular graphs / rank | |||
Normal rank |
Latest revision as of 14:36, 29 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A note on a family of directed strongly regular graphs |
scientific article |
Statements
A note on a family of directed strongly regular graphs (English)
0 references
3 August 2000
0 references
A directed strongly regular graph with parameters \((v,k,\mu, \lambda,t)\) is a loopless digraph on \(v\) vertices, whose adjacency matrix A satisfies the matrix equations \(\text{A}^2= t\text{I}+ \lambda\text{A}+ \mu(\text{J}- \text{I}- \text{A})\) and \(\text{JA}= \text{AJ}= k\text{J}\), where J is the all-ones matrix and I the identity matrix. These are equivalent to the more familiar combinatorial conditions. The present paper shows how to construct a new infinite family of directed strongly regular graphs using the directed Cayley graphs.
0 references
directed strongly regular graph
0 references
digraph
0 references
Cayley graphs
0 references