Search Results for ""
5991 - 6000 of 6485 for Finite Group D 4Search Results
The Brocard circle, also known as the seven-point circle, is the circle having the line segment connecting the circumcenter O and symmedian point K of a triangle DeltaABC as ...
Bonato et al. (2014, 2015) defined the burning number of a simple graph as follows. Consider a process called burning involving are discrete time steps. Each node is either ...
A cactus graph, sometimes also called a cactus tree, a mixed Husimi tree, or a polygonal cactus with bridges, is a connected graph in which any two graph cycles have no edge ...
A branch of mathematics that is a sort of generalization of calculus. Calculus of variations seeks to find the path, curve, surface, etc., for which a given function has a ...
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 ...
Find a way to stack a square of cannonballs laid out on the ground into a square pyramid (i.e., find a square number which is also square pyramidal). This corresponds to ...
The Cantor set T_infty, sometimes also called the Cantor comb or no middle third set (Cullen 1968, pp. 78-81), is given by taking the interval [0,1] (set T_0), removing the ...
Define a carefree couple as a pair of positive integers (a,b) such that a and b are relatively prime (i.e., GCD(a,b)=1) and a is squarefree. Similarly, define a strongly ...
Cartesian coordinates are rectilinear two- or three-dimensional coordinates (and therefore a special case of curvilinear coordinates) which are also called rectangular ...
The Cassini ovals are a family of quartic curves, also called Cassini ellipses, described by a point such that the product of its distances from two fixed points a distance ...
...
View search results from all Wolfram sites (352745 matches)

