Multigraph
Undirected multigraph (edges with own identity)

A multigraph G is an ordered triple G := (V, E, r) with

Some authors allow multigraphs to have loops, that is, an edge that connects a vertex to itself, while others call these pseudographs, reserving the term multigraph for the case with no loops.
punctuation:no_comma, detectable_format:json_format