TOPICS
Search

Search Results for ""


691 - 700 of 1355 for Symmetric MatrixSearch Results
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 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 ...
The Pappus graph is a cubic symmetric distance-regular graph on 18 vertices, illustrated above in three embeddings. It is Hamiltonian and can be represented in LCF notation ...
The four parameters e_0, e_1, e_2, and e_3 describing a finite rotation about an arbitrary axis. The Euler parameters are defined by e_0 = cos(phi/2) (1) e = [e_1; e_2; e_3] ...
Define psi(x)={1 0<=x<1/2; -1 1/2<x<=1; 0 otherwise (1) and psi_(jk)(x)=psi(2^jx-k) (2) for j a nonnegative integer and 0<=k<=2^j-1. So, for example, the first few values of ...
Consider the general system of two first-order ordinary differential equations x^. = f(x,y) (1) y^. = g(x,y). (2) Let x_0 and y_0 denote fixed points with x^.=y^.=0, so ...
The Dirac matrices are a class of 4×4 matrices which arise in quantum electrodynamics. There are a variety of different symbols used, and Dirac matrices are also known as ...
A cubic vertex-transitive graph is a cubic graph that is vertex transitive. Read and Wilson (1998, pp. 161-163) enumerate all connected cubic vertex-transitive graphs on 34 ...
1 ... 67|68|69|70|71|72|73 ... 136 Previous Next

...