Graph Theory — Set & Matrix Notation

Part II — The Basics of Graph Theory Notation

Article Originally Published On https://www.setzeus.com/

A graph G consists of two sets of items: vertices (V) & edges (E). In other words, a graph G = <V,E>.

Simple Graphs — Set Notation

In this article, in contrast to the opening piece of this series, we’ll work though graph examples. The first example graph we’ll review contains specific properties that classify it as a simple graph. Simple graphs are graphs whose vertices are unweighted, undirected, & exclusive of multiple edges & self-directed loops. It’s okay to not understand the previous terms as we’ll cover graph properties extensively in the following article. For now let’s start with an example visualization below:

Article Originally Published On https://www.setzeus.com/

Visual graph representations, like the one depicted above, contain a plethora of useful information; however, in order to uncover this data in a way that’s operation-capable, we need a different way to describe the graph. First, let’s go ahead & notate the example graph above in order to better understand the opening G = <V,E> formula. To start notating, since our vertices are missing labels, we go ahead & assign any random node…