602
edits
Terminology in Interpretive Structural Modeling (view source)
Revision as of 10:33, 9 January 2022
, 9 January 2022no edit summary
No edit summary |
No edit summary |
||
| Line 163: | Line 163: | ||
|[[Characteristic Logic Equation]] | |[[Characteristic Logic Equation]] | ||
|Expresses the necessary and sufficient conditions to be satisfied by the entries in an [[Interconnection Matrix]] M<sub>BA</sub>, that interconnects two hierarchical digraphs A<sup>*</sup> and B<sup>*</sup> for which M<sub>AB</sub> = 0. | |Expresses the necessary and sufficient conditions to be satisfied by the entries in an [[Interconnection Matrix]] M<sub>BA</sub>, that interconnects two hierarchical digraphs A<sup>*</sup> and B<sup>*</sup> for which M<sub>AB</sub> = 0. | ||
|ref | |||
|- | |||
|34 | |||
|[[Cascade Interconnection of Digraphs]] | |||
|Two digraphs are said to be cascaded if all interconnections are oriented from one of the digraphs to the other. | |||
|ref | |||
|- | |||
|35 | |||
|[[Digraphs]] | |||
|A directed graph, also called a digraph, is a graph in which the edges have a direction. | |||
|ref | |ref | ||
|- | |- | ||