Maeckes logo

<    1      2      3    >


Graph

A graph G = (V, E) is an ordered pair, in which V is an arbitrary set and E is a multiset consisting of multisets of two elements from V , which may or may not be different.

 


Explanation

The elements of V are called the vertices of graph G, and the elements of E are called the edges of G. The vertices that form an edge are called the endpoints of the edge.

 


العربية   Deutsch   Español   Français   Nederlands   中文   Русский