TOPICS
Search

Rijeka Graph

DOWNLOAD Mathematica NotebookDownload Wolfram Notebook

The Rijeka graph is the first-known example of a strongly regular graph with parameters (nu,k,lambda,mu)=(216,40,4,8). It arises from an imprimitive action of the group PSU(4,2) and was discovered by Crnković et al. (2018). It is distance-regular (but not distance-transitive) and has intersection array [40,35;1,8] and graph spectrum 40^14^(140)(-8)^75.

The name "Rijeka graph" was introduced in honor of the city of Rijeka, Croatia in which the university of the discoverers is located (DistanceRegular.org).

See also

Strongly Regular Graph, Trsat Graphs

Explore with Wolfram|Alpha

References

Crnković, D.; Rukavina, S.; and A. Švob, A. "New Strongly Regular Graphs From Orthogonal Groups O^+(6,2) and O^-(6,2)." Discr. Math. 341, 2723-2728, 2018.Crnković, D.; Pavese, F.; and Švob, A. "On the PSU(4,2)-iNvariant Vertex-Transitive Strongly Regular (216, 40, 4, 8) Graph." Graphs Combin. 36, 503-513, 2020.DistanceRegular.org. "Trsat Graphs." https://www.math.mun.ca/distanceregular/graphs/trsat.html.

Cite this as:

Weisstein, Eric W. "Rijeka Graph." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/RijekaGraph.html

Subject classifications