New feasibility conditions for directed strongly regular graphs (Q510327)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: New feasibility conditions for directed strongly regular graphs |
scientific article; zbMATH DE number 6686269
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New feasibility conditions for directed strongly regular graphs |
scientific article; zbMATH DE number 6686269 |
Statements
New feasibility conditions for directed strongly regular graphs (English)
0 references
17 February 2017
0 references
Summary: We prove two results for directed strongly regular graphs that have an eigenvalue of multiplicity less than \(k\), the common out-degree of each vertex. The first bounds the size of an independent set, and the second determines an eigenvalue of the subgraph on the out-neighborhood of a vertex. Both lead to new nonexistence results for parameter sets.
0 references
directed strongly regular graph
0 references
