Search Results for ""

A graph cycle.

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 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 ...

Consider two cylinders as illustrated above (Hubbell 1965) where the cylinders have radii r_1 and r_2 with r_1<=r_2, the larger cylinder is oriented along the z-axis, and ...

"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 union G=G_1 union G_2 of graphs G_1 and G_2 with disjoint point sets V_1 and V_2 and edge sets X_1 and X_2 is the graph with V=V_1 union V_2 and X=X_1 union X_2 (Harary ...

The Hall-Janko graph, also known as the Hall-Janko-Wales graph, is a strongly regular graph on 100 nodes with parameters (nu,k,lambda,mu)=(100,36,14,12). It is also a ...

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 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 ...

The curve formed by the intersection of a cylinder and a sphere is known as Viviani's curve. The problem of finding the lateral surface area of a cylinder of radius r ...