
doi: 10.37236/5496
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.
Graphs and linear algebra (matrices, eigenvalues, etc.), directed strongly regular graph, Association schemes, strongly regular graphs
Graphs and linear algebra (matrices, eigenvalues, etc.), directed strongly regular graph, Association schemes, strongly regular graphs
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
