Dyad algebra and multiplication of graphs. I. Directed graphs
โ Scribed by Oktay Sinanoglu
- Publisher
- Springer
- Year
- 1993
- Tongue
- English
- Weight
- 420 KB
- Volume
- 14
- Category
- Article
- ISSN
- 0259-9791
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
## Abstract We study the multiplicativity and its variations of weak multiplicativity and very weak multiplicativity, analyze the role of connectivity condition in their definitions, and explore the relationship between them. New classes of multiplicative graphs and digraphs as well as weak multipl
We consider the problem of constructing a matrix with prescribed row and ร 4 column sums, subject to the condition that the off-diagonal entries are in 0, 1 and the diagonal entries are nonnegative integers. The pair of row and column sum vectors is called realizable if such a matrix exists. This is