Search Results for ""

A closed trail is called a circuit when it is specified in cyclic order but no first vertex is explicitly identified.

The circuit rank gamma, also denoted mu (Volkmann 1996, Babić et al. 2002) or beta (White 2001, p. 56) and known as the cycle rank (e.g., White 2001, p. 56), (first) graph ...

Gradshteyn and Ryzhik (2000) define the circulant determinant by (1) where omega_j is the nth root of unity. The second-order circulant determinant is |x_1 x_2; x_2 ...

A circulant graph is a graph of n graph vertices in which the ith graph vertex is adjacent to the (i+j)th and (i-j)th graph vertices for each j in a list l. The circulant ...

An n×n matrix whose rows are composed of cyclically shifted versions of a length-n list l. For example, the 4×4 circulant matrix on the list l={1,2,3,4} is given by C=[4 1 2 ...

A circular pattern obtained by superposing parallel equally spaced lines on a set of concentric circles of increasing radii, then coloring the regions in chessboard fashion. ...

A circular embedding is a graph embedding in which all graph vertices lie on a common circle, usually arranged so they are equally spaced around the circumference. Specific ...

The functions describing the horizontal and vertical positions of a point on a circle as a function of angle (cosine and sine) and those functions derived from them: cotx = ...

The number of ways to arrange n distinct objects along a fixed (i.e., cannot be picked up out of the plane and turned over) circle is P_n=(n-1)!. The number is (n-1)! instead ...

The circular points at infinity, also called the isotropic points, are the pair of (complex) points on the line at infinity through which all circles pass. The circular ...