Algorithm for canonical incidence matrix construction

There are works [9,60] dealing with the theoretic aspects of isomorphism problems for hypergraphs. We propose the algorithmic approach to solve this problem. 

Sets V and E are called parts of a graph F-part and -part. Vertices Uj G F and Ej e E in K H) are adjacent if and only if vertex Vi and edge Ej are incident in H. 

Any finite hypergraph has Konig s representation and vice versa any Konig s graph is a representation of some finite hypergraph H and defines it unambiguously [73]. Hence the study of the properties 

In particular the canonical incidence matrix of hypergraph H can be obtained from the canonical adjacency matrix of Konig s representation K H) of hypergraph H. 

Beside the adjacency matrix of a bipartite graph, the reduced adjacency matrix R K H)) = =, .p,j = 1. is also 

---