Search Results for ""

A chordal graph is a simple graph in which every graph cycle of length four and greater has a cycle chord. In other words, a chordal graph is a graph possessing no chordless ...

The complete bipartite graph K_(1,3) is a tree known as the "claw." It is isomorphic to the star graph S_4, and is sometimes known as the Y graph (Horton and Bouwer 1991; ...

A column-convex polyomino is a self-avoiding convex polyomino such that the intersection of any vertical line with the polyomino has at most two connected components. ...

The complete elliptic integral of the first kind K(k), illustrated above as a function of the elliptic modulus k, is defined by K(k) = F(1/2pi,k) (1) = ...

A complete k-partite graph is a k-partite graph (i.e., a set of graph vertices decomposed into k disjoint sets such that no two graph vertices within the same set are ...

The confluent hypergeometric function of the second kind gives the second linearly independent solution to the confluent hypergeometric differential equation. It is also ...

Cribbage is a game in which each of two players is dealt a hand of six cards. Each player then discards two of his six cards to a four-card "crib" which alternates between ...

A cubic curve is an algebraic curve of curve order 3. An algebraic curve over a field K is an equation f(X,Y)=0, where f(X,Y) is a polynomial in X and Y with coefficients in ...

The cuboctahedral graph is an Archimedean quartic symmetric graph on 12 nodes and 24 edges that is the skeleton of the cuboctahedron, as well as the uniform ...

There are no fewer than three distinct notions of curve throughout mathematics. In topology, a curve is a one-dimensional continuum (Charatonik and Prajs 2001). In algebraic ...