TOPICS
Search

Search Results for ""


11771 - 11780 of 13135 for Computational GeometrySearch Results
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"]. ...
Analysis of data ordered by the time the data were collected (usually spaced at equal intervals), called a time series. Common examples of a time series are daily temperature ...
In the 1980s, Samuel Yates defined a titanic prime to be a prime number of at least 1000 decimal digits. The smallest titanic prime is 10^(999)+7. As of 1990, more than 1400 ...
In general, a topological index, sometimes also known as a graph-theoretic index, is a numerical invariant of a chemical graph (Plavšić et al. 1993). Particular topological ...
A topological space, also called an abstract topological space, is a set X together with a collection of open subsets T that satisfies the four conditions: 1. The empty set ...
A traceable graph is a graph that possesses a Hamiltonian path. Hamiltonian graphs are therefore traceable, but the converse is not necessarily true. Graphs that are not ...
A transition function describes the difference in the way an object is described in two separate, overlapping coordinate charts, where the description of the same set may ...
A group action G×X->X is transitive if it possesses only a single group orbit, i.e., for every pair of elements x and y, there is a group element g such that gx=y. In this ...
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) ...
A planar graph G is said to be triangulated (also called maximal planar) if the addition of any edge to G results in a nonplanar graph. If the special cases of the triangle ...

...