Search Results for ""

A cycle graph of a group is a graph which shows cycles of a group as well as the connectivity between the cycles. Such graphs are constructed by drawing labeled nodes, one ...

The n-cycle complement graph C^__n is the graph complement of the cycle graph C_n. Cycle complement graphs are special cases of circulant graphs. The first few are ...

The cycle double cover conjecture states that every bridgeless graph has a collection of cycles which together contain every edge exactly twice. This conjecture remains open, ...

The cube-connected cycle graph of order n is the graph obtained by replacing each vertex in a n-dimensional hypercube by a cycle of length n. They were introduced by ...

Let a convex cyclic polygon be triangulated in any manner, and draw the incircle to each triangle so constructed. Then the sum of the inradii is a constant independent of the ...

The circumradius of a cyclic polygon is a radius of the circle inside which the polygon can be inscribed. Similarly, the circumradius of a polyhedron is the radius of a ...

The figure determined by four lines, no three of which are concurrent, and their six points of intersection (Johnson 1929, pp. 61-62). Note that this figure is different from ...

The radius of a polygon's incircle or of a polyhedron's insphere, denoted r or sometimes rho (Johnson 1929). A polygon possessing an incircle is same to be inscriptable or ...

Dirac (1952) proved that if the minimum vertex degree delta(G)>=n/2 for a graph G on n>=3 nodes, then G contains a Hamiltonian cycle (Bollobás 1978, Komlós et al. 1996). In ...

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