TOPICS
Search

Pasechnik Graph

DOWNLOAD Mathematica NotebookDownload Wolfram Notebook

The n-Pasechnik graph is a strongly regular graph on (4n-1)^2 vertices constructed from a skew Hadamard matrix of order 4n. It has regular parameters (nu,k,lambda,mu)=((4n-1)^2,2(2n-1)^2,4n^2-6n+3,2(n-1)(2n-1)).

The 1-Pasechnik is isomorphic to the disjoint union of three triangle graphs: 3C_3.

Small Pasechnik graphs are implemented in the Wolfram Language as GraphData[{"Pasechnik", n}].

See also

Strongly Regular Graph

Explore with Wolfram|Alpha

References

House of Graphs. Pasechnik Graphs. 3K3.Pasechnik, D. V. "Skew-Symmetric Association Schemes with Two Classes and Strongly Regular Graphs of Type L_(2n-1)(4n-1)." Acta Appl. Math. 29, 129-138, 1992.

Referenced on Wolfram|Alpha

Pasechnik Graph

Cite this as:

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

Subject classifications