Graphs and hypergraphs
Steffen Lilholt Lauritzen · Graphical Models · 1996
Abstract A graph, as we use it throughout this book, is a pair 𝒢 = (V, E), where V is a finite set of vertices and the set of edges E is a subset of the set V x V of ordered pairs of distinct vertices. Thus our graphs are simple, i.e. there are no multiple edges and they have no loops.