fixed-point-free graph
Смотреть что такое "fixed-point-free graph" в других словарях:
Point and figure chart — A point and figure chart is used for technical analysis of securities. Unlike most other investment charts, point and figure charts do not present a linear representation of time. Instead, they show trends in price.The aim of point and figure… … Wikipedia
Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… … Wikipedia
Minor (graph theory) — In graph theory, an undirected graph H is called a minor of the graph G if H is isomorphic to a graph that can be obtained by zero or more edge contractions on a subgraph of G. The theory of graph minors began with Wagner s theorem that a graph… … Wikipedia
Stationary point — Not to be confused with a fixed point where x = f(x). Stationary points (red pluses) and inflection points (green circles). The stationary points in this graph are all relative maxima or relative minima. In mathematics, particularly in calculus,… … Wikipedia
Planar graph — Example graphs Planar Nonplanar Butterfly graph K5 The complete graph K4 … Wikipedia
Crossing number (graph theory) — A drawing of the Heawood graph with three crossings. This is the minimum number of crossings among all drawings of this graph, so the graph has crossing number cr(G) = 3. In graph theory, the crossing number cr(G) of a graph G is the… … Wikipedia
Evenness of zero — The number 0 is even. There are several ways to determine whether an integer is even or odd, all of which indicate that 0 is an even number: it is a multiple of 2, it is evenly divisible by 2, it is surrounded on both sides by odd integers, and… … Wikipedia
Kleene's recursion theorem — In computability theory, Kleene s recursion theorems are a pair of fundamental results about the application of computable functions to their own descriptions. The theorems were first proved by Stephen Kleene in 1938.This article uses the… … Wikipedia
Combinatory logic — Not to be confused with combinational logic, a topic in digital electronics. Combinatory logic is a notation introduced by Moses Schönfinkel and Haskell Curry to eliminate the need for variables in mathematical logic. It has more recently been… … Wikipedia
Rotation system — In combinatorial mathematics, rotation systems encode embeddings of graphs onto orientable surfaces, by describing the circular ordering of a graph s edges around each vertex.A more formal definition of a rotation system involves pairs of… … Wikipedia
Ising model — The Ising model, named after the physicist Ernst Ising, is a mathematical model in statistical mechanics. It has since been used to model diverse phenomena in which bits of information, interacting in pairs, produce collectiveeffects.Definition… … Wikipedia
