memDump

Head

Jul 30, 20261 min read

In graph theory, the head [1] of a directed edge (u,v) is its second vertex v, the vertex the edge points toward; the other endpoint, u, is called the edge’s tail.

Definition


Definition 1 (Head)

Let (u,v) be a directed edge. The vertex v is called the head of the edge.

References

  1. [1]

    “Directed graph”, Wikipedia, Available: https://en.wikipedia.org/wiki/Directed_graph, Accessed: 2026-07-14 ↩


Graph View

  • References

Backlinks

  • Directed edge
  • Edge
  • Endpoint
  • Tail
  • Incidence matrix