Search Results for ""

There are four strongly regular graphs with parameters (nu,k,lambda,mu)=(28,12,6,4), one of them being the triangular graph of order 8. The other three such graphs are known ...

The Clebsch graph, also known as the Greenwood-Gleason graph (Read and Wilson, 1998, p. 284) and illustrated above in a number of embeddings, is a strongly regular quintic ...

Contracting tensors lambda with nu in the Bianchi identities R_(lambdamunukappa;eta)+R_(lambdamuetanu;kappa)+R_(lambdamukappaeta;nu)=0 (1) gives ...

The Conway-Smith graph is a distance-transitive graph on 63 vertices having intersection array {10,6,4,1;1,2,6,10} (Hall 1980). It is also distance-transitive. It is denoted ...

Let A be an edge cut of a connected graph G. Then the cyclic edge connectivity lambda_c(G) is the size of a smallest cyclic edge cut, i.e., a smallest edge cut A such that ...

A coordinate system defined by the transformation equations x = a/Lambdacnmucnnucospsi (1) y = a/Lambdacnmucnnusinpsi (2) z = a/Lambdasnmudnmusnnudnnu, (3) where ...

A variable that appears in a calculation only as a placeholder and which disappears completely in the final result. For example, in the integral int_0^xf(x^')dx^', x^' is a ...

Given a differential operator D on the space of differential forms, an eigenform is a form alpha such that Dalpha=lambdaalpha (1) for some constant lambda. For example, on ...

A coordinate system similar to toroidal coordinates but with fourth-degree instead of second-degree surfaces for constant mu so that the toroids of circular cross section are ...

The Games graph is a strongly regular graph on 729 vertices with parameters (nu,k,lambda,mu)=(729,112,1,20). It is distance-regular but not distance-transitive with ...