Search Results for ""

A graphic sequence is a sequence of numbers which can be the degree sequence of some graph. A sequence can be checked to determine if it is graphic using GraphicQ[g] in the ...

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

A sequence {a_n}_(n=1)^N forms a (binary) heap if it satisfies a_(|_j/2_|)<=a_j for 2<=j<=N, where |_x_| is the floor function, which is equivalent to a_i<a_(2i) and ...

A Heronian tetrahedron, also called a perfect tetrahedron, is a (not necessarily regular) tetrahedron whose sides, face areas, and volume are all rational numbers. It ...

The recursive sequence defined by the recurrence relation a(n)=a(a(n-1))+a(n-a(n-1)) (1) with a(1)=a(2)=1. The first few values are 1, 1, 2, 2, 3, 4, 4, 4, 5, 6, ... (OEIS ...

A graph G is a hypotraceable graph if G has no Hamiltonian path (i.e., it is not a traceable graph), but G-v has a Hamiltonian path (i.e., is a traceable graph) for every v ...

p^x is an infinitary divisor of p^y (with y>0) if p^x|_(y-1)p^y, where d|_kn denotes a k-ary Divisor (Guy 1994, p. 54). Infinitary divisors therefore generalize the concept ...

A regularly spaced array of points in a square array, i.e., points with coordinates (m,n,...), where m, n, ... are integers. Such an array is often called a grid or mesh, and ...

Interval arithmetic is the arithmetic of quantities that lie within specified ranges (i.e., intervals) instead of having definite known values. Interval arithmetic can be ...

An invertible knot is a knot that can be deformed via an ambient isotopy into itself but with the orientation reversed. A knot that is not invertible is said to be ...