Binary Directed Graph
(Redirected from binary directed graph)
Jump to navigation
Jump to search
A Binary Directed Graph is a directed graph that is a binary graph.
- AKA: Binary Digraph.
- Context:
- It can be represented by a Binary Directed Graph Dataset.
- …
- Counter-Example(s):
- See: Social Network, Structural Equivalence.
References
2006?
- Structural Equivalence
- QUOTE: … Similar to clique identification, the definition of structural equivalence is very rigorous. In a directed binary graph, two nodes are structurally equivalent in a specific relation if they have identical patterns of ties sent to and received from all the other nodes in the network. More precisely, nodes i and j are structurally equivalent if, for all nodes k in the network (but not including i or j), node i sends a tie to node k, if and only if j also sends a tie to k, and node i receives a tie from k if and only if j also receives a tie from k (Wasserman and Faust, 1994:356).