ruled graph - определение. Что такое ruled graph
Diclib.com
Словарь ChatGPT
Введите слово или словосочетание на любом языке 👆
Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

  • как употребляется слово
  • частота употребления
  • используется оно чаще в устной или письменной речи
  • варианты перевода слова
  • примеры употребления (несколько фраз с переводом)
  • этимология

Что (кто) такое ruled graph - определение

SURFACE THROUGH EVERY POINT OF WHICH RUNS A STRAIGHT LINE WHICH EQUALLY IS ON THE SURFACE
Doubly ruled; Doubly ruled surface; Doubly Ruled Surface; Ruled Surface; Doubly-ruled surface; Ruled algebraic surface; Ruling of a cone
  • Ruled surface generated by two [[Bézier curve]]s as directrices (red, green)
  • Definition of a ruled surface: every point lies on a line
  • Hyperbolic paraboloid
  • Möbius strip
  • hyperboloid of one sheet for <math>\varphi=63^\circ</math>
  • cylinder, cone
  • Developable connection of two ellipses and its development
  • helicoid

Null graph         
GRAPH WITHOUT EDGES (ON ANY NUMBER OF VERTICES)
Empty tree; Empty graph; Null Graph; Null tree; Singleton graph; Edgeless graph; Order-zero graph
In the mathematical field of graph theory, the term "null graph" may refer either to the order-zero graph, or alternatively, to any edgeless graph (the latter is sometimes called an "empty graph").
Turán graph         
  • The [[octahedron]], a 3-[[cross polytope]] whose edges and vertices form ''K''<sub>2,2,2</sub>, a Turán graph ''T''(6,3). Unconnected vertices are given the same color in this face-centered projection.
GRAPH
Turan graph; Cocktail party graph; Octahedral Graph; Octahedral graph
The Turán graph, denoted by T(n,r), is a complete multipartite graph; it is formed by partitioning a set of n vertices into r subsets, with sizes as equal as possible, and then connecting two vertices by an edge if and only if they belong to different subsets. Where q and s are the quotient and remainder of dividing n by r (so n = qr + s), the graph is of the form K_{q+1, q+1, \ldots, q, q}, and the number of edges is
Dense graph         
GRAPH IN WHICH THE NUMBER OF EDGES IS CLOSE TO THE MAXIMUM FOR ITS NUMBER OF VERTICES
Sparse graph; Graph density; Density (graph theory)
In mathematics, a dense graph is a graph in which the number of edges is close to the maximal number of edges (where every pair of vertices is connected by one edge). The opposite, a graph with only a few edges, is a sparse graph.

Википедия

Ruled surface

In geometry, a surface S is ruled (also called a scroll) if through every point of S there is a straight line that lies on S. Examples include the plane, the lateral surface of a cylinder or cone, a conical surface with elliptical directrix, the right conoid, the helicoid, and the tangent developable of a smooth curve in space.

A ruled surface can be described as the set of points swept by a moving straight line. For example, a cone is formed by keeping one point of a line fixed whilst moving another point along a circle. A surface is doubly ruled if through every one of its points there are two distinct lines that lie on the surface. The hyperbolic paraboloid and the hyperboloid of one sheet are doubly ruled surfaces. The plane is the only surface which contains at least three distinct lines through each of its points (Fuchs & Tabachnikov 2007).

The properties of being ruled or doubly ruled are preserved by projective maps, and therefore are concepts of projective geometry. In algebraic geometry, ruled surfaces are sometimes considered to be surfaces in affine or projective space over a field, but they are also sometimes considered as abstract algebraic surfaces without an embedding into affine or projective space, in which case "straight line" is understood to mean an affine or projective line.