Search Results for ""
1491 - 1500 of 1613 for packing problemSearch Results
The word "graph" has (at least) two meanings in mathematics. In elementary mathematics, "graph" refers to a function graph or "graph of a function," i.e., a plot. In a ...
A graph embedding, sometimes also called a graph drawing, is a particular drawing of a graph. Graph embeddings are most commonly drawn in the plane, but may also be ...
The mathematical study of the properties of the formal mathematical structures called graphs.
A Hamilton decomposition (also called a Hamiltonian decomposition; Bosák 1990, p. 123) of a Hamiltonian regular graph is a partition of its edge set into Hamiltonian cycles. ...
A Heronian triangle is a triangle having rational side lengths and rational area. The triangles are so named because such triangles are related to Heron's formula ...
The hypercube is a generalization of a 3-cube to n dimensions, also called an n-cube or measure polytope. It is a regular polytope with mutually perpendicular sides, and is ...
Consider the plane quartic curve X defined by x^3y+y^3z+z^3x=0, where homogeneous coordinates have been used here so that z can be considered a parameter (the plot above ...
Let ||f|| be the supremum of |f(x)|, a real-valued function f defined on (0,infty). If f is twice differentiable and both f and f^('') are bounded, Landau (1913) showed that ...
The least common multiple of two numbers a and b, variously denoted LCM(a,b) (this work; Zwillinger 1996, p. 91; Råde and Westergren 2004, p. 54), lcm(a,b) (Gellert et al. ...
The term limit comes about relative to a number of topics from several different branches of mathematics. A sequence x_1,x_2,... of elements in a topological space X is said ...
...
View search results from all Wolfram sites (160484 matches)

