Search Results for ""

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

A Cunningham number is a binomial number of the form C^+/-(b,n)=b^n+/-1 with b>1 and n positive integers. Bases b^k which are themselves powers need not be considered since ...

The curl of a vector field, denoted curl(F) or del xF (the notation used in this work), is defined as the vector field having magnitude equal to the maximum "circulation" at ...

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

Curves which, when rotated in a square, make contact with all four sides. Such curves are sometimes also known as rollers. The "width" of a closed convex curve is defined as ...

One would think that by analogy with the matching-generating polynomial, independence polynomial, etc., a cycle polynomial whose coefficients are the numbers of cycles of ...

A cyclide is a pair of focal conics which are the envelopes of two one-parameter families of spheres, sometimes also called a cyclid. The cyclide is a quartic surface, and ...

The dart graph is the 5-vertex graph illustrated above. It is implemented in the Wolfram Language as GraphData["DartGraph"].

Given relatively prime integers p and q (i.e., (p,q)=1), the Dedekind sum is defined by s(p,q)=sum_(i=1)^q((i/q))(((pi)/q)), (1) where ((x))={x-|_x_|-1/2 x not in Z; 0 x in ...

Given an undirected graph, a degree sequence is a monotonic nonincreasing sequence of the vertex degrees (valencies) of its graph vertices. The number of degree sequences for ...