Sinónimos & Anagramas | Palabra Inglés GRAPH

---

---

---

---

---

---

---

---

---

---

Ejemplos de uso de GRAPH en una oración

• Abbe numbers are used in the design of achromatic lenses, as their reciprocal is proportional to dispersion (slope of refractive index versus wavelength) in the wavelength region where the human eye is most sensitive (see graph).
• The derivative of a function of a single variable at a chosen input value, when it exists, is the slope of the tangent line to the graph of the function at that point.
• An (N, M, D, K, e)-disperser is a bipartite graph with N vertices on the left side, each with degree D, and M vertices on the right side, such that every subset of K vertices on the left side is connected to more than (1 − e)M vertices on the right.
• In graph theory, an expander graph is a sparse graph that has strong connectivity properties, quantified using vertex, edge or spectral expansion.
• In power engineering, a "bus" is any graph node of the single-line diagram at which voltage, current, power flow, or other quantities are to be evaluated.
• A typical graph of the forgetting curve purports to show that humans tend to halve their memory of newly learned knowledge in a matter of days or weeks unless they consciously review the learned material.
• In graph theory, the girth of an undirected graph is the length of a shortest cycle contained in the graph.
• In mathematics and computer science, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects.
• It represents the idea that the graph of a continuous function on a closed interval can be drawn without lifting a pencil from the paper.
• The curve is a graph showing the proportion of overall income or wealth assumed by the bottom x% of the people, although this is not rigorously true for a finite population (see below).
• Goal node (computer science), a node in a graph that meets defined criteria for success or termination.
• A plane graph can be defined as a planar graph with a mapping from every node to a point on a plane, and from every edge to a plane curve on that plane, such that the extreme points of each curve are the points mapped from its end nodes, and all curves are disjoint except on their extreme points.
• Radius (graph theory), the minimum distance from a graph's node to the node that is farthest from it.
• The hub and hosts, and the transmission lines between them, form a graph with the topology of a star.
• It is a directed or undirected graph consisting of vertices, which represent concepts, and edges, which represent semantic relations between concepts, mapping or connecting semantic fields.
• In simple cases, this function can be represented as a two-dimensional graph of an independent scalar input versus the dependent scalar output (known as a transfer curve or characteristic curve).
• GEGL is modelled after a directed acyclic graph, where each node represents an image operation (called "operators" or "ops"), and each edge represents an image.
• In a directional antenna in which the objective is to emit the radio waves in one direction, the lobe in that direction is designed to have higher field strength than the others, so on a graph of the radiation pattern it appears biggest; this is the main lobe.
• A minimum spanning tree (MST) or minimum weight spanning tree is a subset of the edges of a connected, edge-weighted undirected graph that connects all the vertices together, without any cycles and with the minimum possible total edge weight.
• In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized.
• The "chain" is an exponentially growing pyramid (a tree graph) that cannot be sustained indefinitely.
• In computer science, a control-flow graph (CFG) is a representation, using graph notation, of all paths that might be traversed through a program during its execution.
• A perfect matching is also called a 1-factor; see Graph factorization for an explanation of this term.
• In economics, an indifference curve connects points on a graph representing different quantities of two goods, points between which a consumer is indifferent.
• He is the discoverer of several graph theory algorithms, including his strongly connected components algorithm, and co-inventor of both splay trees and Fibonacci heaps.

La preparación de la página tomó: 513,24 ms.