Search Results for ""

A graph vertex in a graph is said to be an odd node if its vertex degree is odd.

A cograph (or "complement-reducible graph") is simple graph defined by the criteria 1. K_1 is a cograph, 2. If X is a cograph, then so is its graph complement, and 3. If X ...

The metric dimension beta(G) (Tillquist et al. 2021) or dim(G) (Tomescu and Javid 2007, Ali et al. 2016) of a graph G is the smallest number of nodes required to identify all ...

How can n points be distributed on a unit sphere such that they maximize the minimum distance between any pair of points? This maximum distance is called the covering radius, ...

A point v is a central point of a graph if the eccentricity of the point equals the graph radius. The set of all central points is called the graph center.

The solid angle Omega subtended by a surface S is defined as the surface area Omega of a unit sphere covered by the surface's projection onto the sphere. This can be written ...

The unit of solid angle. The solid angle corresponding to all of space being subtended is 4pi steradians.

The Hajós number h(G) of a graph G is the maximum k such that G contains a subdivision of the complete graph K_k.

Let graph G have p points v_i and graph H have p points u_i, where p>=3. Then if for each i, the subgraphs G_i=G-v_i and H_i=H-u_i are isomorphic, then the graphs G and H are ...

Given a point P, the point P^' which is the antipodal point of P is said to be the antipode of P. The term antipode is also used in plane geometry. Given a central conic (or ...