Our object is to develop matrix formulas for measuring transitivity in digraphs and balance in signed graphs or digraphs. The transitivity ratio is introduced giving the probability that a 2‐step path will be completed to a transitive triple. As it is not feasible to enumerate all cycles in a signed graph or digraph, restrictive degrees of balance are considered which involve only small cycles.
No takes yet. Share an insight, caveat, or question.
Harary et al. (1979) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: