Wolfram Function Repository
Instant-use add-on functions for the Wolfram Language
Function Repository Resource:
Compute the branchial hypergraph of a graph
ResourceFunction["BranchialHypergraph"][g] computes the branchial hypergraph of a graph g. | |
ResourceFunction["BranchialHypergraph"][g,n] computes the branchial hypergraph of a graph g up to the nth level of ancestry. |
"IncludeUnary" | False | whether to include unary hyperedges |
Compute branchial hyperedges of a simple graph:
In[1]:= | ![]() |
Out[1]= | ![]() |
Branchial hypergraph of a mixed graph:
In[2]:= | ![]() |
Out[2]= | ![]() |
Specify the maximum level of ancestry:
In[3]:= | ![]() |
Out[3]= | ![]() |
The branchial hypergraph of any undirected graph is empty:
In[4]:= | ![]() |
Out[4]= | ![]() |
Generate a simple string substitution multiway system with the resource function MultiwaySystem and compute its branchial hypergraph:
In[5]:= | ![]() |
Out[5]= | ![]() |
In[6]:= | ![]() |
Out[6]= | ![]() |
Use the resource function WolframModelPlot to visualize the branchial hypergraph:
In[7]:= | ![]() |
Out[7]= | ![]() |
Include unary hyperedges:
In[8]:= | ![]() |
Out[8]= | ![]() |
Recover the branchial graph from the hypergraph:
In[9]:= | ![]() |
Out[9]= | ![]() |
This work is licensed under a Creative Commons Attribution 4.0 International License