This article is cited in 2 papers

Mathematics of networks

Dihypergraphs: matrix representations

S. L. Blyumin

Lipetsk State Technical University

Abstract: Incidence matrices construction routine is proposed for dihypergraphs. It uses relevant degrees of unity root to describe hyperpoints and hyperarcs orientation. Valence and adjacency matrices along with Laplacians are also constructed for dihypergraphs and their duals.

Keywords: dihypergraphs, unity root, incidence matrix, valence matrix, adjacency matrix, Laplacian.

UDC: 517.977.58
BBK: 22.176

Bibliographic databases:

•