Search Results for ""

A diagonal slash resembling the solidus, but with slightly less slant, used to denote division for in-line equations such as a/b, 1/(x-1)^2, etc.

A linkage used in the original steam engine to turn back-and-forth motion into approximately straight-line motion.

The vertex count of a graph g, commonly denoted V(g) or |g|, is the number of vertices in g. In other words, it is the cardinality of the vertex set. The vertex count of a ...

Let G be a finite, connected, undirected graph with graph diameter d(G) and graph distance d(u,v) between vertices u and v. A radio labeling of a graph G is labeling using ...

A white bishop graph is a graph formed from possible moves of a bishop chess piece, which may make diagonal moves of any length on a chessboard (or any other board), when ...

The degree of a graph vertex v of a graph G is the number of graph edges which touch v. The vertex degrees are illustrated above for a random graph. The vertex degree is also ...

The Euler-Gergonne-Soddy triangle is the right triangle DeltaZFlEv created by the pairwise intersections of the Euler line L_E, Soddy line L_S, and Gergonne line L_G. (The ...

The Janko-Kharaghani-Tonchev graph is a strongly regular graph on 324 vertices and 24786 edges. It has regular parameters (nu,k,lambda,mu)=(324,153,72,72). It is implemented ...

The Jahangir graph J_(n,m) is a kind of generalized wheel graph with consisting of mn circular vertices and a central vertex connected to every mth vertex around the circle. ...

There are several attractive polyhedron compounds consisting of three cubes. The first (left figures) arises by joining three cubes such that each shares two C_2 axes (Holden ...