New feasibility conditions for directed strongly regular graphs (Q510327): Difference between revisions

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.