Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9498268 | Linear Algebra and its Applications | 2005 | 9 Pages |
Abstract
If there exists a k-regular directed graph on n vertices such that its adjacency matrix has rank r then knâBr. We use this to exclude existence of directed strongly regular graphs for infinitely many feasible parameter sets.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
Authors
L.K. Jørgensen,