graph
A graph
A multigraph
In general, a graph may have more than one edge joining a pair of vertices; when this occurs, these edges are called multiple edges. Also, a graph may have loops—a loop is an edge that joins a vertex to itself. In the other graph shown, there are 2 edges joining V1 and V3 and 3 edges joining V2 and V3; the graph also has three loops. See multigraph.
Normally, V(G) and E(G) are finite, but if this is not so, the result may also be called a graph, though some prefer to call this an infinite graph.
- discrete mathematics
- discrete metric
- discrete random variable
- discrete space
- discretization
- discriminant
- discriminatory
- disjoint
- disjoint union
- disjunction
- disjunctive normal form
- dispersion
- displacement
- dissection
- dissipative force
- distance
- distance
- distance between two codewords
- distance between two lines
- distance between two points
- distance between two points
- distance from a point to a line
- distance from a point to a plane
- distance‐time graph
- distinct