Math 2.0

definition

Multigraph

Definition

A multigraph is a triple G=(V,E,r)G = (V, E, r) of a set VV of vertices, a set EE of edges, and a map rr. The map rr assigns to each edge e∈Ee \in E a set r(e)⊆Vr(e) \subseteq V of one or two vertices, the ends of ee. Two distinct edges may have the same ends. Such edges are parallel, or multiple, edges. An edge with only one end is a loop.

Remarks

Some authors do not allow loops in a multigraph, and they call a multigraph with loops a pseudograph. A graph is a multigraph without loops and without parallel edges. The Seven Bridges of Königsberg form a multigraph with 44 vertices and 77 edges.

Explanations

L1 human

A multigraph is like a graph, but two points can be joined by several lines. A road map with two different roads between the same two towns is a multigraph.

What this node needs for W2
  • edge instance_of in: one example (0 of 1)
  • edge not_instance_of in: one non-example that fails one clause (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What this needs

To read this node, read these 2 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Graph definition
  2. Multigraph definition

Sources

  1. Web https://en.wikipedia.org/wiki/Multigraph, Undirected multigraph (edges with own identity)