Search Results for ""
851 - 860 of 13135 for Basic terminologySearch Results
A camel graph is a graph formed by all possible moves of a hypothetical chess piece called a "camel" which moves analogously to a knight except that it is restricted to moves ...
The curve given by the polar equation r=a(1-costheta), (1) sometimes also written r=2b(1-costheta), (2) where b=a/2. The cardioid has Cartesian equation ...
A caterpillar graph, caterpillar tree, or simply "caterpillar," is a tree in which every graph vertex is on a central stalk or only one graph edge away from the stalk (in ...
A cubic curve invented by Diocles in about 180 BC in connection with his attempt to duplicate the cube by geometrical methods. The name "cissoid" first appears in the work of ...
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 curve with polar coordinates, r=b+asectheta (1) studied by the Greek mathematician Nicomedes in about 200 BC, also known as the cochloid. It is the locus of points a fixed ...
The cricket graph is the 5-vertex graph illustrated above. It is implemented in the Wolfram Language as GraphData["CricketGraph"].
A plot of the map winding number W resulting from mode locking as a function of Omega for the circle map theta_(n+1)=theta_n+Omega-K/(2pi)sin(2pitheta_n) (1) with K=1. (Since ...
The Fox H-function is a very general function defined by where 0<=m<=q, 0<=n<=p, alpha_j,beta_j>0, and a_j,b_j are complex numbers such that no pole of Gamma(b_j-beta_js) for ...
A fusene is a simple planar 2-connected graph embedded in the plane with all vertices of degree 2 or 3, all bounded faces (not necessarily regular) hexagons, and all vertices ...
...
View search results from all Wolfram sites (32987 matches)

