- triangular graph
- мат. триангулированный граф
Большой англо-русский и русско-английский словарь. 2001.
triangular graph
Смотреть что такое "triangular graph" в других словарях:
Graph paper — Regular graphing paper (upper); Logarithmic graphing paper (lower). Graph paper, graphing paper, grid paper or millimeter paper is writing paper that is printed with fine lines making up a … Wikipedia
Planar graph — Example graphs Planar Nonplanar Butterfly graph K5 The complete graph K4 … Wikipedia
Comparability graph — In graph theory, a comparability graph is an undirected graph that connects pairs of elements that are comparable to each other in a partial order. Comparability graphs have also been called transitively orientable graphs, partially orderable… … Wikipedia
Lattice graph — The terms lattice graph, mesh graph, or grid graph refer to a number of categories of graphs whose drawing corresponds to some grid/mesh/lattice, i.e., its vertices correspond to the nodes of the mesh and its edges correspond to the ties between… … Wikipedia
Complete graph — K7, a complete graph with 7 vertices Vertices n Edges … Wikipedia
Girth (graph theory) — In graph theory, the girth of a graph is the length of a shortest cycle contained in the graph.[1] If the graph does not contain any cycles (i.e. it s an acyclic graph), its girth is defined to be infinity.[2] For example, a 4 cycle (square) has… … Wikipedia
Unit disk graph — In geometric graph theory, a unit disk graph is the intersection graph of a family of unit circles in the Euclidean plane. That is, we form a vertex for each circle, and connect two vertices by an edge whenever the corresponding circles cross… … Wikipedia
Dürer graph — Melencolia I by Albrecht Dürer, the first appearance of Dürer s solid (1514). In the mathematical field of graph theory, the Dürer graph is an undirected graph with 12 vertices and 18 edges. It is named after Albrecht Dürer, whose 1514 engraving… … Wikipedia
Erdős-Diophantine graph — In Diophantine geometry, an Erdős Diophantine graph, named after Paul Erdős and Diophantus of Alexandria, is a complete graph with vertices located on the integer square grid scriptstylemathbb{Z}^2 such that all mutual distances between the… … Wikipedia
Schwarz triangle — In geometry, a Schwarz triangle, named after Hermann Schwarz is a spherical triangle that can be used to tile a sphere, possibly overlapping, through reflections in its edges. They were classified in (Schwarz 1873). These can be defined more… … Wikipedia
Uniform tiling — In geometry, a uniform tiling is a tessellation of the plane by regular polygon faces with the restriction of being vertex uniform.Uniform tilings can exist in both the Euclidean plane and hyperbolic plane. Uniform tilings are related to the… … Wikipedia
