Graphs and Matrices

Abstract

A graph is a pair \(G=(V,E)\), where V is a non-empty set of vertices and E a set of edges, namely, a set of unordered pairs of distinct vertices. We say that two vertices \(x,y\in V\) are adjacent if \(\{x,y\}\in E\). In this case we also write \(x\sim y\). A graph \(G=(V,E)\) is called finite if V is a finite set.