Search Results for ""

The Klein graph is a weakly regular graph that is the dual graph of the cubic symmetric graph F_(056)B. The Klein graph is illustrated above in four order-4 LCF notations. ...

LCF notation is a concise and convenient notation devised by Joshua Lederberg (winner of the 1958 Nobel Prize in Physiology and Medicine) for the representation of cubic ...

The absolute value of a real number x is denoted |x| and defined as the "unsigned" portion of x, |x| = xsgn(x) (1) = {-x for x<=0; x for x>=0, (2) where sgn(x) is the sign ...

A Bessel function of the second kind Y_n(x) (e.g, Gradshteyn and Ryzhik 2000, p. 703, eqn. 6.649.1), sometimes also denoted N_n(x) (e.g, Gradshteyn and Ryzhik 2000, p. 657, ...

The Dirichlet eta function is the function eta(s) defined by eta(s) = sum_(k=1)^(infty)((-1)^(k-1))/(k^s) (1) = (1-2^(1-s))zeta(s), (2) where zeta(s) is the Riemann zeta ...

A finite group is a group having finite group order. Examples of finite groups are the modulo multiplication groups, point groups, cyclic groups, dihedral groups, symmetric ...

A tree is a mathematical structure that can be viewed as either a graph or as a data structure. The two views are equivalent, since a tree data structure contains not only a ...

The squared norm of a four-vector a=(a_0,a_1,a_2,a_3)=a_0+a is given by the dot product a^2=a_mua^mu=(a^0)^2-a·a, (1) where a·a is the usual vector dot product in Euclidean ...

The Coxeter graph is a nonhamiltonian cubic symmetric graph on 28 vertices and 42 edges which can be constructed as illustrated above. It can also be constructed as the graph ...

The Dyck graph is unique cubic symmetric graph on 32 nodes, illustrated above in a number of embeddings. It is denoted F_(032)A in the Foster census of cubic symmetric graphs ...