-
1 критический граф
Русско-английский словарь по машиностроению > критический граф
-
2 критический граф
-
3 критический граф
-
4 критический граф
свойства графа; теоретико-графовые свойства — graph features
вычислительный граф; граф вычислений — computation graph
произведение графов; граф-произведение — product graph
Русско-английский новый политехнический словарь > критический граф
-
5 критический граф
Русско-английский словарь по информационным технологиям > критический граф
-
6 неприведенный граф
irreducible graph мат.Русско-английский научно-технический словарь Масловского > неприведенный граф
-
7 ориентированный граф
1. oriented graph2. digraph3. directed graphРусско-английский большой базовый словарь > ориентированный граф
-
8 критический граф
Mathematics: critical graph, irreducible graph -
9 критический
adj. critical; критический граф, irreducible graph; критический индекс, critical exponentРусско-английский словарь математических терминов > критический
-
10 геомеоморфно неприводимый граф
Mathematics: homeomorphically irreducible graphУниверсальный русско-английский словарь > геомеоморфно неприводимый граф
-
11 неприведённый граф
Mathematics: irreducible graphУниверсальный русско-английский словарь > неприведённый граф
-
12 критический
adj. critical;
критический граф - irreducible graph;
критический индекс - critical exponent -
13 гомеоморфно неприводимый граф
Русско-английский научно-технический словарь Масловского > гомеоморфно неприводимый граф
-
14 критический
См. также в других словарях:
Irreducible (mathematics) — In mathematics, the term irreducible is used in several ways. * In abstract algebra, irreducible can be an abbreviation for irreducible element; for example an irreducible polynomial. * In representation theory, an irreducible representation is a … 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
Tree (graph theory) — Trees A labeled tree with 6 vertices and 5 edges Vertices v Edges v 1 Chromatic number … Wikipedia
Maximal independent set — This article is about the combinatorial aspects of maximal independent sets of vertices in a graph. For other aspects of independent vertex sets in graph theory, see Independent set (graph theory). For other kinds of independent sets, see… … Wikipedia
Perron–Frobenius theorem — In linear algebra, the Perron–Frobenius theorem, proved by Oskar Perron (1907) and Georg Frobenius (1912), asserts that a real square matrix with positive entries has a unique largest real eigenvalue and that the corresponding… … Wikipedia
Matroid — In combinatorics, a branch of mathematics, a matroid ( /ˈmeɪ … Wikipedia
Polynomial — In mathematics, a polynomial (from Greek poly, many and medieval Latin binomium, binomial [1] [2] [3], the word has been introduced, in Latin, by Franciscus Vieta[4]) is an expression of finite length constructed from variables (also known as… … Wikipedia
Quantum group — In mathematics and theoretical physics, quantum groups are certain noncommutative algebras that first appeared in the theory of quantum integrable systems, and which were then formalized by Vladimir Drinfel d and Michio Jimbo. There is no single … Wikipedia
Symmetric group — Not to be confused with Symmetry group. A Cayley graph of the symmetric group S4 … Wikipedia
Subfactor — In the theory of von Neumann algebras, a subfactor of a factor M is a subalgebra that is a factor and contains 1. The theory of subfactors led to the discovery of the Jones polynomial in knot theory.Index of a subfactorUsually M is taken to be a… … Wikipedia
Littelmann path model — In mathematics, the Littelmann path model is a combinatorial device due to Peter Littelmann for computing multiplicities without overcounting in the representation theory of symmetrisable Kac Moody algebras. Its most important application is to… … Wikipedia