A directed strongly regular graph is a simple directed graph with adjacency matrix A such that the span of A, the identity matrix I, and the unit matrix J is closed under matrix multiplication.
We guarantee you’ll find the right tutor, or we’ll cover the first hour of your lesson.