A graph in which the edges are ordered pairs, so that, if the edge (a, b) is in the graph, the edge (b, a) need not be in the graph and is distinct from (a, b) if it is.
A topological 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 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 graph topology.
A set of vertices (or nodes) connected together by edges; (formally) an ordered 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 Graph (discrete mathematics) on Wikipedia.Wikipedia
A graphical unit on the token-level, the abstracted fundamental shape of a character or letter as distinct from its ductus (realization in a particular typeface or handwriting on the instance-level) and as distinct by a grapheme on the type-level by not fundamentally distinguishing meaning.
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.
A set of points constituting a graphical representation of a real function; (formally) a set of tuples (x_1,x_2,…,x_m,y)∈ R ᵐ⁺¹, where y=f(x_1,x_2,…,x_m) for a given function f: R ᵐ→ R . See also Graph of a function on Wikipedia.Wikipedia
A morphism 𝛤_f from the domain of f to the product of the domain and codomain of f, such that the first projection applied to 𝛤_f equals the identity of the domain, and the second projection applied to 𝛤_f is equal to f.
To draw a graph of a function.
To draw a graph.