Search Results for ""

Tietze's graph is the cubic graph on 12 nodes and 18 edges illustrated above in a number of embeddings. It is implemented in the Wolfram Language as GraphData["TietzeGraph"]. ...

If f(omega) is square integrable over the real omega-axis, then any one of the following implies the other two: 1. The Fourier transform F(t)=F_omega[f(omega)](t) is 0 for ...

Every planar graph (i.e., graph with graph genus 0) has an embedding on a torus. In contrast, toroidal graphs are embeddable on the torus, but not in the plane, i.e., they ...

The total domination number gamma_t of a graph is the size of a smallest total dominating set, where a total dominating set is a set of vertices of the graph such that all ...

The tower of Hanoi (commonly also known as the "towers of Hanoi"), is a puzzle invented by E. Lucas in 1883. It is also known as the Tower of Brahma puzzle and appeared as an ...

The transcendence degree of Q(pi), sometimes called the transcendental degree, is one because it is generated by one extra element. In contrast, Q(pi,pi^2) (which is the same ...

The term "transition matrix" is used in a number of different contexts in mathematics. In linear algebra, it is sometimes used to mean a change of coordinates matrix. In the ...

The triakis tetrahedral graph is Archimedean dual graph which is the skeleton of the triakis tetrahedron. It is implemented in the Wolfram Language as ...

Hoggatt and Denman (1961) showed that any obtuse triangle can be divided into eight acute isosceles triangles. There are 1, 4, 23, 180, 1806, 20198, ... (OEIS A056814) ...

The interior of the triangle is the set of all points inside a triangle, i.e., the set of all points in the convex hull of the triangle's vertices. The simplest way to ...