Graph Concepts: Difference between revisions
Jump to navigation
Jump to search
(Created page with "=Internal= * Graphs") |
|||
| Line 1: | Line 1: | ||
=Internal= | =Internal= | ||
* [[Graphs#Subjects|Graphs]] | * [[Graphs#Subjects|Graphs]] | ||
=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 [[#Vertex|vertices]], called the '''vertex set''' of G, and E is a [[/Relations#Overview|binary relation]] on G, called the '''edge set''' of G, which contains the graph's [[#Edge|edges]]. | |||
=<span id='Vertex'></span><span id='Node'></span>Vertex (Node)= | |||
=<span id='Edge'></span><span id='Arc'></span>Edge (Arc)= | |||
Revision as of 19:47, 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.