Matrix operations and the properties of networks and directed graphs

DOI10.1016/0022-2496(77)90042-6zbMath0352.05039OpenAlexW1987140379MaRDI QIDQ1235717

Edmund R. Peay

Publication date: 1977

Published in: Journal of Mathematical Psychology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-2496(77)90042-6

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Large-scale network analysis with applications to transportation, communication and inference networks ⋮ Structural models with qualitative values

Cites Work

• Nonmetric grouping: clusters and cliques
• The number of paths and cycles in a digraph
• On the connectivity of social networks†
• Généralisation de l'algorithme de Warshall
• A Note on a Generalization of Boolean Matrix Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Matrix operations and the properties of networks and directed graphs