Finding a minimal spanning hypertree of a weighted hypergraph

A hypergraph has a complex structure, which is why some re- searchers seek to transform the hypergraph into a graph. In this paper, we present two corresponding graphs for each hypergraph and naming them in the Clique graph and the Persian graph. They have a simpler structure than the graph, and it is easier to work with these graphs. Using these graphs, we are looking for minimal spanning hypertree for the hypergraph.

Automated summary

This paper introduces a method to transform a hypergraph into a graph, with the presentation of two corresponding graphs called the Clique graph and the Persian graph. These graphs have simpler structures and are easier to work with. The main objective of the paper is to find the minimal spanning hypertree for the hypergraph.