-
41 bipartite graph
graph features — свойства графа; теоретико-графовые свойства
computation graph — вычислительный граф; граф вычислений
product graph — произведение графов; граф-произведение
The English-Russian dictionary general scientific > bipartite graph
-
42 critical graph
graph features — свойства графа; теоретико-графовые свойства
computation graph — вычислительный граф; граф вычислений
product graph — произведение графов; граф-произведение
The English-Russian dictionary general scientific > critical graph
-
43 взвешенный ориентированный граф
Большой англо-русский и русско-английский словарь > взвешенный ориентированный граф
-
44 chain weight
т. граф. вес цепиа) (в неориентированном графе: функция, определенная на множестве ребер цепи; чаще всего, сумма весов ребер)б) т. граф. (в орграфе: алгебраическая сумма весов дуг в цепи, вычисляемая по следующему правилу: вес дуги берется со знаком "+", если дуга проходится в направлении ее ориентации, и со знаком "-" в противном случае)See: -
45 population ageing
соц., демогр. старение населения, демографическое старение ( увеличение доли пожилых людей в структуре населения)Syn:Ant:
См. также в других словарях:
Directed graph — A directed graph. A directed graph or digraph is a pair G = (V,A) (sometimes G = (V,E)) of:[1] a set V, whose elements are called vertices or … Wikipedia
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 — 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
Line graph — This article is about the mathematical concept. For statistical presentation method, see line chart. In graph theory, the line graph L(G) of undirected graph G is another graph L(G) that represents the adjacencies between edges of G. The name… … Wikipedia
Skew-symmetric graph — In graph theory, a branch of mathematics, a skew symmetric graph is a directed graph that is isomorphic to its own transpose graph, the graph formed by reversing all of its edges. The isomorphism is required to be an involution without any fixed… … Wikipedia
Dominator (graph theory) — For Dominating set problem, see Dominating set. In computer science, in control flow graphs, a node d dominates a node n if every path from the start node to n must go through d. Notationally, this is written as d dom n (or sometimes d n). By… … Wikipedia
Coates graph — In mathematics, the Coates graph or Coates flow graph, named after C.L. Coates, is a graph associated with the Coates method for the solution of a system of linear equations.[1][2] The Coates graph Gc(A) associated with an n × n matrix… … Wikipedia
Distance-hereditary graph — A distance hereditary graph. In graph theoretic mathematics, a distance hereditary graph (also called a completely separable graph)[1] is a graph in which the distances in any connected induced subgraph are the same as they are in the original… … Wikipedia
Path (graph theory) — In graph theory, a path in a graph is a sequence of vertices such that from each of its vertices there is an edge to the next vertex in the sequence. The first vertex is called the start vertex and the last vertex is called the end vertex . Both… … Wikipedia
Signed graph — In the area of graph theory in mathematics, a signed graph is a graph in which each edge has a positive or negative sign.Formally, a signed graph Sigma; is a pair ( G , sigma;) that consists of a graph G = ( V , E ) and a sign mapping or… … Wikipedia