Definition:Loop-Graph/Formal Definition

From ProofWiki
Jump to navigation Jump to search

Definition

A loop-graph $G$ is a non-empty set $V$ together with a symmetric relation $E$ on $G$.

Thus it can be seen that a loop-graph is a simple graph with the stipulation that the relation $E$ does not need to be antireflexive.


Also see

  • Results about loop-graphs can be found here.


Sources