Search Results for ""

The Wormald graph is a unit-distance 4-chromatic graph with girth 5 on 13+5(13; 5)=6448 vertices.

The Doob graph D(m,n) is the graph given by the graph Cartesian product of m>=1 copies of the Shrikhande graph with a Hamming graph H(n,4). Doob graphs are distance-regular ...

The graph diameter of a graph is the length max_(u,v)d(u,v) of the "longest shortest path" (i.e., the longest graph geodesic) between any two graph vertices (u,v), where ...

A finite simple connected graph G is quadratically embeddable if its quadratic embedding constant QEC(G) is nonpositive, i.e., QEC(G)<=0. A graph being quadratically ...

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

The Suzuki graph is an edge-transitive strongly regular graph on 1782 vertices with parameters (nu,k,lambda,mu)=(1782,416,100,96) and automorphism group Suz.2. It is an ...

An AB percolation is a discrete percolation model in which the underlying point lattice graph L has the properties that each of its graph vertices is occupied by an atom ...

An algorithm is a specific set of instructions for carrying out a procedure or solving a problem, usually with the requirement that the procedure terminate at some point. ...

The anticomplementary circle is the circumcircle of the anticomplementary triangle. It has radius R_A=2R, where R is the circumradius of the reference triangle, and center at ...

The Atzema spiral, also known as the Pritch-Atzema spiral, is the curve whose catacaustic for a radiant point at the origin is a circle, as illustrated above. It has ...