TOPICS
Search

Trsat Graphs

DOWNLOAD Mathematica NotebookDownload Wolfram Notebook

The Trsat graphs are two graphs that are the first known examples of strongly regular graphs with parameters (nu,k,lambda,mu)=(540,187,58,68). They arise from an imprimitive action of the group PSU(4,2), and eere discovered by Crnković et al. (2018). Both graphs are distance-regular (but not distance-transitive) and have intersection array [187,128;1,68] and graph spectrum 187^17^(374)(-17)^(165).

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

See also

Distance-Regular Graph, Rijeka Graph

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.DistanceRegular.org. "Trsat Graphs." https://www.math.mun.ca/distanceregular/graphs/trsat.html.

Cite this as:

Weisstein, Eric W. "Trsat Graphs." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/TrsatGraphs.html

Subject classifications