factor of graph
Смотреть что такое "factor of graph" в других словарях:
Factor-critical graph — In graph theory, a mathematical discipline, factor critical graph is a graph with n vertices in which any subset of n − 1 vertices has a perfect matching. For example, any odd length cycle graph is factor critical.Factor critical graphs must… … Wikipedia
Graph factorization — Not to be confused with Factor graph. 1 factorization of Desargues graph: each color class is a 1 factor … 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
Factor graph — In mathematics, a factor graph is an X,F bipartite graph where X={X 1,X 2,dots,X n} is a set of variables and F={f 1,f 2,dots,f m} is a set of factors. A factor f j is a function mapping from a subset of variables X jsubseteq X to some range… … Wikipedia
Graph theory — In mathematics and computer science, graph theory is the study of graphs : mathematical structures used to model pairwise relations between objects from a certain collection. A graph in this context refers to a collection of vertices or nodes and … Wikipedia
graph — /graf, grahf/, n. 1. a diagram representing a system of connections or interrelations among two or more things by a number of distinctive dots, lines, bars, etc. 2. Math. a. a series of points, discrete or continuous, as in forming a curve or… … Universalium
Critical graph — In general the notion of criticality can refer to any measure. But in graph theory, when the term is used without any qualification, it almost always refers to the chromatic number of a graph. Critical graphs are interesting because they are the… … Wikipedia
Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… … Wikipedia
Matching (graph theory) — In the mathematical discipline of graph theory, a matching or independent edge set in a graph is a set of edges without common vertices. It may also be an entire graph consisting of edges without common vertices. Covering packing dualities… … Wikipedia
Feynman graph — A Feynman graph is a graph suitable to be a Feynman diagram in a particular application of quantum field theory. (The most common use is when each field has quanta (particles) associated with it as the quantum of the electromagnetic field is a… … Wikipedia
Crown graph — Crown graphs with six, eight, and ten vertices. In graph theory, a branch of mathematics, a crown graph on 2n vertices is an undirected graph with two sets of vertices ui and vi and with an edge from ui to vj whenever i ≠ j. The crown… … Wikipedia
