Search Results for ""
12001 - 12010 of 13135 for Coordinate GeometrySearch Results
A 2-variable oriented knot polynomial P_L(a,z) motivated by the Jones polynomial (Freyd et al. 1985). Its name is an acronym for the last names of its co-discoverers: Hoste, ...
An n-Hadamard graph is a graph on 4n vertices defined in terms of a Hadamard matrix H_n=(h)_(ij) as follows. Define 4n symbols r_i^+, r_i^-, c_i^+, and c_i^-, where r stands ...
The Hadwiger number of a graph G, variously denoted eta(G) (Zelinka 1976, Ivančo 1988) or h(G) (Stiebitz 1990), is the number of vertices in the largest complete minor of G ...
The Hajós graph (Brandstädt et al. 1987, Berge 1989) is another name for the Sierpiński sieve graph S_2, which is isomorphic to the 2-sun graph. However, the term is also ...
A Halin graph, sometimes known as a roofless polyhedron, is a polyhedral graph constructed from a planar embedding of a tree having four or more vertices, no vertices of ...
For a connected bipartite graph G, the halved graph G^+ and G^- are the two connected components of the distance 2-graph of G. The following table summarizes some named ...
The volumes of any n n-dimensional solids can always be simultaneously bisected by a (n-1)-dimensional hyperplane. Proving the theorem for n=2 (where it is known as the ...
Let the sum of the squares of the digits of a positive integer s_0 be represented by s_1. In a similar way, let the sum of the squares of the digits of s_1 be represented by ...
The smallest nontrivial taxicab number, i.e., the smallest number representable in two ways as a sum of two cubes. It is given by 1729=1^3+12^3=9^3+10^3. The number derives ...
The Hatzel graph is a planar hypohamiltonian graph on 57 vertices that was the smallest known example of such a graph until the discovery of the Zamfirescu graph on 48 ...
...