Digraphs: Difference between revisions

From Dialogic Design Science
Jump to navigation Jump to search
No edit summary
No edit summary
 
Line 7: Line 7:
The formal definition is:
The formal definition is:
If v and w are vertices, an edge is an unordered pair {v,w}, while a directed edge, called an arc, is an ordered pair (v,w) or (w,v).
If v and w are vertices, an edge is an unordered pair {v,w}, while a directed edge, called an arc, is an ordered pair (v,w) or (w,v).
[[Category: ISM Terminology]]

Latest revision as of 11:28, 10 January 2022

A digraph is a directed graph; a graph in which the edges have a direction.

This is usually indicated with an arrow on the edge.

A Digraph portrays a Contextual Relation among the elementsof the system and can be converted into an [[Interpretive Structural Model of the system with respect to that relation.

The formal definition is: If v and w are vertices, an edge is an unordered pair {v,w}, while a directed edge, called an arc, is an ordered pair (v,w) or (w,v).