Graph Concepts: Difference between revisions
Jump to navigation
Jump to search
| Line 5: | Line 5: | ||
=<span id='Vertex'></span><span id='Node'></span><span id='Vertices_and_Edges'></span>Vertex (Node)= | =<span id='Vertex'></span><span id='Node'></span><span id='Vertices_and_Edges'></span>Vertex (Node)= | ||
<span id='Vertex'></span>An elements of the vertex set V is called '''vertex''' (plural '''vertices'''). An alternate term for vertex, used sometimes in the graph theory literature, is '''node'''. We prefer to use the term "node" when we refer to the vertices of [[Tree#Rooted_Tree|rooted trees]]. We use "vertex" as a more generic term that refers to graphs in general. Another alternate name is '''entity'''. | |||
=<span id='Edge'></span><span id='Arc'></span>Edge (Arc)= | =<span id='Edge'></span><span id='Arc'></span>Edge (Arc)= | ||
Revision as of 19:49, 1 October 2021
Internal
Graph Definition
A graph is a pair-wise relationship among a set of objects. Mathematically, a graph G is a pair (V, E), where V is a finite set of vertices, called the vertex set of G, and E is a binary relation on G, called the edge set of G, which contains the graph's edges.
Vertex (Node)
An elements of the vertex set V is called vertex (plural vertices). An alternate term for vertex, used sometimes in the graph theory literature, is node. We prefer to use the term "node" when we refer to the vertices of rooted trees. We use "vertex" as a more generic term that refers to graphs in general. Another alternate name is entity.