Graph Edge Relation

A Graph Edge Relation is a relation that indicates the presence or absence of a [[Graph Edge}graph edge]] between two graph nodes.

• Context:
  • It can be a Transitive Relation.
  • It can be:
    • a Directed Graph Edge Relation (for Directed Graph Edges),
    • an Undirected Graph Edge Relation (for Undirected Graph Edges).
• See: Graph Edge Count.

---