Search Results for ""

"The" Y-graph is another term used to refer to a claw graph. The term "Y-graph" is also used to refer to a graph expansion with the Y graph as its base (e.g., Horton and ...

A graph with a finite number of nodes and edges. If it has n nodes and has no multiple edges or graph loops (i.e., it is simple), it is a subgraph of the complete graph K_n. ...

A cyclic graph is a graph containing at least one graph cycle. A graph that is not cyclic is said to be acyclic. A cyclic graph possessing exactly one (undirected, simple) ...

A fixed point for which the stability matrix has one zero eigenvector with negative eigenvalue lambda<0.

Let A and B be two *-algebras. An algebraic homomorphism phi:A->B is called *-homomorphism if it satisfies phi(a^*)=phi(a)^* for each a in A.

A fixed point for which the stability matrix has one zero eigenvector with positive eigenvalue lambda>0.

An orthogonal projection of a cross onto a three-dimensional subspace. It is said to be normalized if the cross vectors are all of unit length.

A quintic graph is a graph which is 5-regular. The only quintic graph on n<=7 nodes is the complete graph K_6. Quintic graphs exist only on even numbers of nodes, and the ...

A sextic graph is a regular graph of degree six. The numbers of simple sextic graphs on n=7, 8, ... nodes are 1, 1, 4, 21, 266, 7846, 367860, ... (OEIS A006822). Examples are ...

A fractal composed of repeated copies of a pentagram or other polygon. The above figure shows a generalization to different offsets from the center.