In graph theory a pseudograph is a particular type of graph. A pseudograph is a set of vertices and for each unordered pair of vertices a set of edges between these.

A directed pseudograph is also called a quiver.

The terminology is used in distinction to:

  1. multigraphs, which are like pseudographs but not admitted to have “loops” in the sense of edges between a vertex and itself;

  2. simple graphs, which are multigraphs with at most one edge between any unordered pair of distinct vertices.

Beware that the terminology is not completely consistent across different authors. Some authors may allows loops when they speak of multigraphs.


Last revised on September 19, 2018 at 15:26:53. See the history of this page for a list of all contributions to it.