Function Repository Resource:

HypergraphAdjacencyMatrix

Find the adjacency matrix for vertices in a hypergraph

Contributed by: Stephen Wolfram

ResourceFunction["HypergraphAdjacencyMatrix"][hg]

finds the adjacency matrix for the hypergraph hg.

Details and Options

The entries in the hypergraph adjacency matrix count the number of cooccurrences of vertices within edges.

A hypergraph is represented by a list of edge lists, with each edge list containing a list of vertices in that edge.

ResourceFunction["HypergraphAdjacencyMatrix"] returns a SparseArray object, which can be converted to an ordinary matrix using Normal.

Make an adjacency matrix from a fairly simple hypergraph:

In[1]:=

Out[1]=

Use MatrixPlot to visualize the matrix:

In[2]:=

Out[2]=

See the adjacency matrix:

In[3]:=

Out[3]=