Directed strongly regular graphs with μ=λ=t−1 and k−1 divisible by μ are constructed from cyclic groups. Nonexistence of a directed strongly regular graph ...
Missing: mu= lambda.
Jørgensen, L. K. (2001). Directed strongly regular graphs with mu = lambda. Discrete Mathematics, 231(1-3), 289-293. Jørgensen, Leif Kjær. / Directed strongly ...
In this paper, we first prove that these two equivalence relations are equivalent to each other for a large class of symbolic matrix systems. State splitting of ...
A directed strongly regular graph (DSRG) is a graph on n vertices in which every vertex has indegree and outdegree k and the number of paths of length two from ...
Oct 22, 2024 · In this paper we show that there exist a dsrg with such a feasible parameter set only if k/n is 1/5, 1/3, 2/5, 1/2, 3/5, or 2/3. Every dsrg with ...
... lambda,\mu$). Note that if $k=t$ and these matrix conditions are satisfied, then $\Gamma$ is an (undirected) strongly regular graph, while if $t=0$ then ...
Dec 14, 2024 · In this paper we present a method for constructing directed strongly regular graphs with assumed action of an automorphism group. The ...
A k-regular simple graph G on nu nodes is strongly k-regular if there exist positive integers k, lambda, and mu such that every vertex has k neighbors.
Dec 23, 2014 · We can suppose that μ≥1, therefore there exist three vertices u1,u2,u3 such that u2u3 is a non-edge, but u1u2 and u1u3 are edges.
... {directed strongly regular graph} (Duval \cite{Du}) with parameters $(v, k, t, \lambda, \mu)$ is a directed graph $\Gamma$ on $v$ vertices without loops such ...