# Undirected Graph Edge

(Redirected from undirected graph edge)

Jump to navigation
Jump to search
An Undirected Graph Edge is a Graph Edge with no Ordering(Ordered Relation) to its Graph Nodes.

**AKA:**Undirected Edge, Undirected Link.**Context:**- It can be represented by a Binary Set of Graph Nodes.
- It can be from a Undirected Graph.
- …

**Counter-Example(s):****See:**Symmetric Relation.