- multiple edges
- кратные [параллельные] ребра
Большой англо-русский и русско-английский словарь. 2001.
multiple edges
Смотреть что такое "multiple edges" в других словарях:
Multiple edges — joining two vertices. In graph theory, multiple edges (also called parallel edges or a multi edge), are two or more edges that are incident to the same two vertices. A simple graph has no multiple edges. Depending on the context, a graph may be… … Wikipedia
Multiple patterning — is a class of technologies developed for photolithography to enhance the feature density. The simplest case of multiple patterning is double patterning, where a conventional lithography process is enhanced to produce double the expected number of … Wikipedia
Multiple integral — Topics in Calculus Fundamental theorem Limits of functions Continuity Mean value theorem Differential calculus Derivative Change of variables Implicit differentiation Taylor s theorem Related rates … 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
Multigraph — Pseudograph redirects here. It is not to be confused with Pseudepigraph. This article is about the mathematical concept. For other uses, see Multigraph (disambiguation). A multigraph with multiple edges (red) and several loops (blue). Not all… … Wikipedia
Pseudoforest — A 1 forest (a maximal pseudoforest), formed by three 1 trees In graph theory, a pseudoforest is an undirected graph[1] in which every connected component has at most one cycle. That is, it is a system of vertices and edges connecting pairs of ve … 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
Dynkin diagram — See also: Coxeter–Dynkin diagram Finite Dynkin diagrams Affine (extended) Dynkin diagrams … Wikipedia
Modularity (networks) — For other uses, see Modularity. Modularity is one measure of the structure of networks or graphs. It measures the strength of division of a network into modules (also called groups, clusters or communities). Networks with high modularity have… … Wikipedia
Edge detection — is a terminology in image processing and computer vision, particularly in the areas of feature detection and feature extraction, to refer to algorithms which aim at identifying points in a digital image at which the image brightness changes… … Wikipedia
Minor (graph theory) — In graph theory, an undirected graph H is called a minor of the graph G if H is isomorphic to a graph that can be obtained by zero or more edge contractions on a subgraph of G. The theory of graph minors began with Wagner s theorem that a graph… … Wikipedia
