×

Matrix operations and the properties of networks and directed graphs. (English) Zbl 0352.05039


MSC:

05C35 Extremal problems in graph theory
05C20 Directed graphs (digraphs), tournaments
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Abelson, R. P.; Rosenberg, M. J., Symbolic psycho-logic: A model of attitudinal cognition, Behavioral Science, 3, 1-13 (1958)
[2] Berztiss, A. T., Data structures: Theory and practice (1975), Academic Press: Academic Press New York · Zbl 0317.68003
[3] Cartwright, D.; Gleason, T. C., The number of paths and cycles in a digraph, Psychometrika, 31, 179-199 (1966) · Zbl 0143.43702
[4] Doreian, P., On the connectivity of social networks, Journal of Mathematical Sociology, 3, 245-258 (1974) · Zbl 0281.92020
[5] Harary, F.; Norman, R. Z.; Cartwright, D., Structural models (1965), Wiley: Wiley New York · Zbl 0139.41503
[6] Hasse, M., Über die Behandlung graphentheorischer Probleme unter Verwendung der Matrizenrechnung, Wissenschaftliche Zeitschrift der Technische Universität Dresden, 10, 1313-1316 (1961) · Zbl 0101.16605
[7] Hu, T. C., Integer programming and network flows (1969), Addison-Wesley: Addison-Wesley Reading, Mass · Zbl 0197.45701
[8] Peay, E. R., Dissertation Abstracts International, 31, 6718A (1971), (University Microfilms No. 71-15, 267)
[9] Peay, E. R., Nonmetric grouping: Clusters and cliques, Psychometrika, 40, 297-313 (1975) · Zbl 0356.62053
[10] Robert, P.; Ferland, J., Generalisation de l’algorithme de Warshall, Revue Francaise d’Informatique et de Recherche Opérationelle, 2, 71-85 (1968) · Zbl 0172.20601
[11] Yoeli, M., A note on a generalization of Boolean matrix theory, American Mathematical Monthly, 68, 552-557 (1961) · Zbl 0115.02103
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.