graph
suomi-englanti sanakirjagraph englannista suomeksi
käyrä, graafinen esitys, kuvaaja, diagrammi, kaaviokuva
piirtää diagrammi
esittää graafisesti
Substantiivi
Verbi
graph englanniksi
A data chart (graphical representation of data) intended to illustrate the relationship between a set (or sets) of numbers (quantities, measurements or indicative numbers) and a reference set, whose elements are indexed to those of the former set(s) and may or may not be numbers.
(hypo)
{{quote-journal
A set of points constituting a graphical representation of a function; a set of tuples (x_1, x_2, \ldots, x_m, y)\in\R^{m+1}, where y=f(x_1, x_2, \ldots, x_m) for a given function f: \R^m\rightarrow\R. See also (pedia) Category:en:Curves Category:en:Functions
1969 Press, Thomas Walsh, Randell Magee (translators), I. M. Gelfand, E. G. Glagoleva, E. E. Shnol, ''Functions and Graphs'', 2002, Dover, page 19,
- Let us take any point of the first graph, for example, \textstyle x=\frac 1 2, y=\frac 4 5, that is, the point \textstyle M_1(\frac 1 2,\frac 4 5).
A set of ''vertices'' (or ''nodes'') connected together by ''edges''; an pair of sets (V,E), where the elements of V are called ''vertices'' or ''nodes'' and E is a set of pairs (called ''edges'') of elements of V. See also (pedia)
1973, Edward Minieka (translator), (w), ''Graphs and Hypergraphs'', Elsevier (North-Holland), 1970, Claude Berge, ''Graphes et Hypergraphes'', page vii,
- Problems involving graphs first appeared in the mathematical folklore as puzzles (e.g. Königsberg bridge problem). Later, graphs appeared in electrical engineering (Kirchhof's Law), chemistry, psychology and economics before becoming a unified field of study.
{{quote-book|en|year=1997|author=Fan R. K. Chung|title=Spectral Graph Theory|publisher=American Mathematical Society|pageurl=https://books.google.com.au/books?id=YUc38_MCuhAC&printsec=frontcover&dq=%22graph%22%7C%22graphs%22&hl=en&sa=X&ved=0ahUKEwjoo9Tsi5feAhWwHDQIHe6XANYQ6AEIzgIwLQv=onepage&q=%22graph%22%7C%22graphs%22&f=false|page=1
A space which represents some graph (ordered pair of sets) and which is constructed by representing the ''vertices'' as ''points'' and the ''edges'' as copies of the numbers|real interval 0,1 (where, for any given edge, 0 and 1 are identified with the points representing the two vertices) and equipping the result with a particular topology called the ''topology''.
(syn)
2008, Unnamed translators (AMS), A. V. Alexeevski, S. M. Natanzon, ''Hurwitz Numbers for Regular Coverings of Surfaces by Seamed Surfaces and Cardy-Frobenius Algebras of Finite Groups'', V. M. Buchstaber, I. M. Krichever (editors), ''Geometry, Topology, and Mathematical Physics: S.P. Novikov's Seminar, 2006-2007'', (w), page 6,
- First, let us define its 1-dimensional analog, that is, a topological graph. A ''graph'' \Delta is a 1-dimensional stratified topological space with finitely many 0-strata (vertices) and finitely many 1-strata (edges).(..)A graph such that any vertex belongs to at least two half-edges we call an ''s-graph''. Clearly the boundary \partial\Omega of a surface \Omega with marked points is an s-graph.
- A morphism of graphs \varphi: \Delta'\rightarrow\Delta'' is a continuous epimorphic map of graphs compatible with the stratification; i.e., the restriction of \varphi to any open 1-stratum (interior of an edge) of \Delta' is a local (therefore, global) homeomorphism with appropriate open 1-stratum of \Delta''.
A morphism \Gamma_f from the domain of f to the product|product of the domain and codomain of f, such that the first projection applied to \Gamma_f equals the morphism|identity of the domain, and the second projection applied to \Gamma_f is equal to f.
A graphical unit on the (l), the abstracted fundamental shape of a character or letter as distinct from its ductus (realization in a particular typeface or handwriting on the (l)) and as distinct by a (l) on the (l) by not fundamentally distinguishing (l).
(quote-book)
To draw a graph, to record graphically.
(quote-book)|isbn=1-936383-41-1|location=Portland|publisher=Eraserhead Press|page=8|passage=When the doctor took the picture that was to be graphed onto Johnny’s balloon head, he suggested that Johnny make a normal face, without expressing any emotion. But Johnny didn’t like that idea. He’d rather look eternally cheerful than express nothing but apathy for the rest of his life.
To draw a graph of a function.