By submitting the following form, you agree to Club Z!'s Terms of Use and Privacy Policy
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.
regular graph | simple directed graph | simple graph | strongly regular graph
Back to List | POWERED BY THE WOLFRAM LANGUAGE