Search Results for ""

The Brouwer-Haemers graph is the unique strongly regular graph on 81 vertices with parameters nu=81, k=20, lambda=1, mu=6 (Brouwer and Haemers 1992, Brouwer). It is also ...

The Wells graph, sometimes also called the Armanios-Wells graph, is a quintic graph on 32 nodes and 80 edges that is the unique distance-regular graph with intersection array ...

The Shrikhande graph is a strongly regular graph on 16 nodes. It is cospectral with the rook graph L_(4,4), so neither of the two is determined by spectrum. The Shrikhande ...

Given two positive integers n and k, the bipartite Kneser graph H(n,k) is the graph whose two bipartite sets of vertices represent the k-subsets and (n-k)-subsets of ...

A unit-distance embedding is a graph embedding in which all edges have unit length. A graph possessing a unit-distance embedding in two dimensions is called a unit-distance ...

The Desargues graph is the cubic symmetric graph on 20 vertices and 30 edges illustrated above in several embeddings. It is isomorphic to the generalized Petersen graph ...

The icosahedral graph is the Platonic graph whose nodes have the connectivity of the regular icosahedron, as well as the great dodecahedron, great icosahedron Jessen's ...

"The" Sylvester graph is a quintic graph on 36 nodes and 90 edges that is the unique distance-regular graph with intersection array {5,4,2;1,1,4} (Brouwer et al. 1989, ...

The local McLaughlin graph is the graph on 162 vertices and 4536 edges obtained from the McLaughlin graph by vertex deletion of a single vertex and its neighbors, making it ...

The folded n-cube graph, perhaps better termed "folded hypercube graph," is a graph obtained by merging vertices of the n-hypercube graph Q_n that are antipodal, i.e., lie at ...