Search Results for ""

Bouwer graphs, a term coined here for the first time, are a family of regular graphs which includes members that are symmetric but not arc-transitive. Such graphs are termed ...

The braced square problem asks, given a hinged square composed of four equal rods (indicated by the red lines above), how many more hinged rods must be added in the same ...

Catalan's constant is a constant that commonly appears in estimates of combinatorial functions and in certain classes of sums and definite integrals. It is usually denoted K ...

The Chebyshev polynomials of the first kind are a set of orthogonal polynomials defined as the solutions to the Chebyshev differential equation and denoted T_n(x). They are ...

Chess is a two-player board game believed to have been played in India as early as the sixth century AD. In different parts of this world, different chess games are played. ...

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

The circumcircle is a triangle's circumscribed circle, i.e., the unique circle that passes through each of the triangle's three vertices. The center O of the circumcircle is ...

The cocktail party graph of order n, also called the hyperoctahedral graph (Biggs 1993, p. 17), n-octahedron graph O_n (Jungerman and Ringel 1978), matching graph (Arvind et ...

Consecutive number sequences are sequences constructed by concatenating numbers of a given type. Many of these sequences were considered by Smarandache and so are sometimes ...

The n-crown graph for an integer n>=3 is the graph with vertex set {x_0,x_1,...,x_(n-1),y_0,y_1,...,y_(n-1)} (1) and edge set {(x_i,y_j):0<=i,j<=n-1,i!=j}. (2) It is ...