-
21 graph loop
т. граф. петля графа (ребро графа, исходящее из вершины и возвращающееся в ту же вершину)See: -
22 graph node
т. граф. точка [вершина\] графа (элемент графа, обозначающий объект любой природы, входящий в множество объектов, описываемое графом)Syn:See: -
23 vertex
т. граф. = graph node -
24 vertex-bichromatic graph
Большой англо-русский и русско-английский словарь > vertex-bichromatic graph
-
25 vertex-chromatic graph
Большой англо-русский и русско-английский словарь > vertex-chromatic graph
-
26 vertex-colorable graph
Большой англо-русский и русско-английский словарь > vertex-colorable graph
-
27 vertex-connected graph
Большой англо-русский и русско-английский словарь > vertex-connected graph
-
28 vertex-critical graph
Большой англо-русский и русско-английский словарь > vertex-critical graph
-
29 vertex-transitive graph
Большой англо-русский и русско-английский словарь > vertex-transitive graph
-
30 vertex-weighted graph
граф со взвешенными вершинамиБольшой англо-русский и русско-английский словарь > vertex-weighted graph
-
31 vertex critical graph
Электроника: вершинно-критический граф -
32 vertex-bichromatic graph
Математика: вершинно бихроматический графУниверсальный англо-русский словарь > vertex-bichromatic graph
-
33 vertex-chromatic graph
Математика: вершинно хроматический графУниверсальный англо-русский словарь > vertex-chromatic graph
-
34 vertex-colorable graph
Математика: граф с раскрашиваемой вершинойУниверсальный англо-русский словарь > vertex-colorable graph
-
35 vertex-connected graph
Математика: вершинно связный графУниверсальный англо-русский словарь > vertex-connected graph
-
36 vertex-critical graph
Математика: вершинно критический граф -
37 vertex-transitive graph
Математика: вершинно транзитивный графУниверсальный англо-русский словарь > vertex-transitive graph
-
38 vertex-weighted graph
Вычислительная техника: граф со взвешенными вершинами -
39 vertex critical graph
English-Russian electronics dictionary > vertex critical graph
-
40 vertex critical graph
The New English-Russian Dictionary of Radio-electronics > vertex critical graph
См. также в других словарях:
Vertex — (Latin: corner; plural vertices or vertexes) may refer to:Mathematics*Vertex (geometry), a corner point of a polygon, polyhedron, tesselation, etc. *Vertex (graph theory), a node in a graph *Vertex (curve), a local extreme point of curvature… … Wikipedia
Vertex (graph theory) — For other uses, see Vertex (disambiguation). A graph with 6 vertices and 7 edges where the vertex number 6 on the far left is a leaf vertex or a pendant vertex In graph theory, a vertex (plural vertices) or node is the fundamental unit out of… … Wikipedia
Graph pebbling — is a mathematical game and area of interest played on a graph with pebbles on the vertices. Game play is composed of a series of pebbling moves. A pebbling move on a graph consists of taking two pebbles off one vertex and placing one on an… … 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 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 (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
Vertex cover — In the mathematical discipline of graph theory, a vertex cover of a graph is a set of vertices such that each edge of the graph is incident to at least one vertex of the set. The problem of finding a minimum vertex cover is a classical… … Wikipedia
Vertex cover problem — In computer science, the vertex cover problem or node cover problem is an NP complete problem and was one of Karp s 21 NP complete problems. It is often used in complexity theory to prove NP hardness of more complicated problems. Definition A… … 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 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 automorphism — In graph theoretical mathematics, an automorphism of a graph is a form of symmetry in which the graph is mapped onto itself while preserving the edge vertex connectivity.Formally, an automorphism of a graph G = ( V , E ) is a permutation sigma;… … Wikipedia