Search Results for ""

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

The set of graph eigenvalues of the adjacency matrix is called the spectrum of the graph. (But note that in physics, the eigenvalues of the Laplacian matrix of a graph are ...

The Hall graph is a distance-transitive graph on 65 vertices having intersection array {10,6,4,1;1,2,5} (Hall 1980). It is denoted Gamma^((3)) by Hall (1980) and was ...

A function on the reals R is a step function if it can be written as a finite linear combination of semi-open intervals [a,b) subset= R. Therefore, a step function f can be ...

The identity function id(x) is the function id(x)=x which assigns every real number x to the same real number x. It is identical to the identity map. The identity function is ...

A function S_n(z) which satisfies the recurrence relation S_(n-1)(z)-S_(n+1)(z)=2S_n^'(z) together with S_1(z)=-S_0^'(z) is called a hemicylindrical function.

The name Lobachevsky's function is sometimes given to the function Lambda(theta)=1/2Cl_2(2theta), also denoted Pi(theta), where Cl_2(x) is Clausen's integral.

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

A graph is planar if it can be drawn in a plane without graph edges crossing (i.e., it has graph crossing number 0). The number of planar graphs with n=1, 2, ... nodes are 1, ...

A cactus graph, sometimes also called a cactus tree, a mixed Husimi tree, or a polygonal cactus with bridges, is a connected graph in which any two graph cycles have no edge ...