Search Results for ""

Let two spheres of radii R and r be located along the x-axis centered at (0,0,0) and (d,0,0), respectively. Not surprisingly, the analysis is very similar to the case of the ...

The term "vesica piscis," meaning "fish bladder" in Latin, is used for the particular symmetric lens formed by the intersection of two equal circles whose centers are offset ...

The hexacode graph is the incidence graph of the unique symmetric transversal design STD_2[6;3]. It is also a bipartite (0,2)-graph. The hexacode graph is a ...

The Nechushtan graph, illustrated above, is a 10-vertex 5-chromatic graph that is unit-distance in 3 dimensions. It was used by Nechushtan (2002) in the construction of of a ...

The Shi-Krotov-Solé graph is a weakly regular graph on 1024 vertices with regular parameters (nu,k,lambda,mu)=(1024,33,2,(0,2)). It is distance-regular but not ...

The Soicher graphs are three distance-regular graphs on 5346, 486, and 315 vertices, respectively. The first two are also distance-transitive but the third is not. The second ...

The Suetake graph is a weakly regular Hamiltonian graph on 231 vertices with parameters (nu,k,lambda,mu)=(72,(12),(0),(0,4)). It is distance-regular with intersection array ...

A distance graph with distance set (0,1].

The Voronov-Neopryatnaya-Dergachev graphs are two graphs on 372 and 972 vertices which have unit-distance embeddings with all vertices on a sphere and chromatic number 5. The ...

The Van Lint-Schrijver Graph graph is a weakly regular Hamiltonian graph on 162 vertices with parameters (nu,k,lambda,mu)=(162,(6),(0),(0,1)). It is distance-regular with ...