-
1 simple graph
т. граф. простой граф (простым графом называется ненаправленный граф, который можно описать с помощью двух множеств: множества вершин и множества ребер; т. е. граф, не содержащий петель и кратных ребер)See: -
2 simple graph
Большой англо-русский и русско-английский словарь > simple graph
-
3 simple graph
Математика: простой граф -
4 simple graph
мат. -
5 graph
1) граф2) график || строить график3) диаграмма || чертить диаграмму•- alternating composition graph - arbitrarily transversable graph - derived graph - doubly connected graph - doubly transitive graph - fully connected graph - locally countable graph - locally finite graph - locally restricted graph - log-log graph - partially labeled graph - partially orderable graph - progressively finite graph - regressively finite graph - strictly weak graph - strongly orientable graph - strongly regular graph - strongly rigid graph - strongly singular graph - strongly smooth graph - totally inductive graph - triangleless graph - triply transitive graph - uniquely intersectable graph - uniquely representable graph - weakly disconnected graph -
6 graph with loops
-
7 graph loop
т. граф. петля графа (ребро графа, исходящее из вершины и возвращающееся в ту же вершину)See: -
8 graph
1) график, диаграммасм. тж. area graph, bar graph, business graphics, diagram, line graph, logarithmic graph, pie graph, ribbon graph, x-y graph2) графматематический объект, представляющий собой конечное множество вершин (node), соединённых рёбрами (edge), или дугами (arc). И тем и другим могут быть сопоставлены атрибуты, а дугам предписаны направления, в этом случае граф называется ориентированным, или орграфомсм. тж. acyclic graph, antisymmetric graph, bigraph, CFG, complete graph, DAG, diameter of graph, directed graph, directed multigraph, disconnected graph, empty graph, graph theory, hypergraph, labeled graph, mixed graph, multigraph, planar graph, random graph, simple circuit, task graph, trivial graphАнгло-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > graph
-
9 simple chain
т. граф. простая цепь (цепь, в которой каждое ребро встречается не более одного раза)Ant:See: -
10 graph chain
т. граф. цепьа) ( в неориентированном графе — маршрут, все ребра которого различны)б) ( в ориентированном графе — последовательность вершин, в которой соседние вершины определяют дугу)See: -
11 simple path
1) Математика: простая траектория, простая цепь, простая цепь (graph theory)2) Программирование: простой путь (в графе) -
12 complete graph
т. граф. полный [совершенный\] граф (обыкновенный граф, в котором любая пара вершин смежна)See: -
13 простой граф
Большой англо-русский и русско-английский словарь > простой граф
-
14 multigraph
-
15 parallel edges
т. граф. кратные ребра (ребра, соединяющие одну и ту же пару вершин)Syn:See: -
16 metrically
метрически metrically bounded functional ≈ метрически ограниченный функционал metrically bounded set ≈ метрически ограниченное множество metrically closed ideal ≈ метрически замкнутый идеал metrically complete hull ≈ метрически полная оболочка metrically complete lattice ≈ метрически полная решетка metrically convergent sequence ≈ метрически сходящаяся последовательность metrically dense set ≈ метрически плотное множество metrically equal spaces ≈ изометрические пространства metrically homogeneous space ≈ метрически однородное пространство metrically reduced module ≈ метрически приведенный модуль metrically reduced ring ≈ метрически приведенное кольцо metrically regular graph ≈ метрически однородный [метрически регулярный] граф metrically simple lattice ≈ метрически простая решетка metrically transitive flow ≈ метрически транзитивный [эргодический] поток metrically transitive process ≈ метрически транзитивный процесс metrically transitive sequence ≈ метрически транзитивная последовательность, эргодическая последовательность metrically transitive transformation ≈ метрически транзитивное преобразование metrically unbounded functional ≈ метрически неограниченный функционал metrically uniform space ≈ метрически равномерное пространство - converge metrically - metrically Chebysheff - metrically closed - metrically compact - metrically complete - metrically connected - metrically convex - metrically decomposable - metrically dense - metrically equal - metrically invariant - metrically simple - metrically transitive - metrically unbounded - metrically uniform - metrically uniformly метрический ;
Большой англо-русский и русско-английский словарь > metrically
-
17 factor
1) фактор || факторный2) коэффициент; множитель3) показатель4) факторизовать; разлагать на множители•to reduce a fraction by a factor — приводить дробь к общему знаменателю; сокращать дробь на некоторый множитель
-
18 language
- absolutely homogeneous language - absolutely inadequate language - absolutely nonhomogeneous language - absolutely nonperfect language - absolutely nonsimple language - absolutely perfect language - absolutely simple language - completely formalized language - completely homogeneous language - left categorial language - locally perfectly adequate language - locally simple language - locally strongly language - locally well adequate language - noncompletely homogeneous language - right categorial language - scattered context languageindistinguishable in the language — лог. неразличимый на языке, эквивалентный
-
19 solution
1) раствор2) растворение3) мат. решение- completely unstable solution - neutrally stable solution - particular solution - pure strategy solution - solution of equation - uniformly stable solutionsolution by inspection — решение подбором, решение проверкой
-
20 topology
мат.- boundedly weak topology - jointly continious topology - locally convex topology - rational sequence topology - topology of bounded convergenc - topology of convergence in measure - topology of extended real - topology of local ring - topology of locally uniform convergence - topology of metric space - topology of pointwise convergence - topology of precompact convergence - topology simple convergencetopology with consistent structure of vector space — топология с совместной структурой векторного пространства
- 1
- 2
См. также в других словарях:
Graph (mathematics) — This article is about sets of vertices connected by edges. For graphs of mathematical functions, see Graph of a function. For statistical graphs, see Chart. Further information: Graph theory A drawing of a labeled graph on 6 vertices and 7 edges … Wikipedia
graph theory — Math. the branch of mathematics dealing with linear graphs. [1965 70] * * * Mathematical theory of networks. A graph consists of nodes (also called points or vertices) and edges (lines) connecting certain pairs of nodes. An edge that connects a… … Universalium
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
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
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
Graph embedding — In topological graph theory, an embedding of a graph G on a surface Sigma; is a representation of G on Sigma; in which points of Sigma; are associated to vertices and simple arcs (homeomorphic images of [0,1] ) are associated to edges in such a… … Wikipedia
Graph drawing — This article is about the general subject of graph drawing. For the annual research symposium, see International Symposium on Graph Drawing. Graphic representation of a minute fraction of the WWW, demonstrating hyperlinks. Graph drawing is an… … Wikipedia
Graph operations — Operations on graphs produce new graphs from old ones. They may be separated into the following major categories. Contents 1 Unary operations 1.1 Elementary operations 1.2 Advanced operations 2 … Wikipedia
Simple path — *In geometry, a simple path is a simple curve, namely, a continuous injective function from an interval in the set of real numbers R to R^n or more generally to a metric space or a topological space. *In graph theory a simple path is a path in a… … Wikipedia
Graph reduction — In computer science, graph reduction implements an efficient version of non strict evaluation, an evaluation strategy where the arguments to a function are not immediately evaluated. This form of non strict evaluation is also known as lazy… … Wikipedia
Planar graph — Example graphs Planar Nonplanar Butterfly graph K5 The complete graph K4 … Wikipedia
