Affiliation:
1. Department of Mathematics, Faculty of Sciences University of Qom, Qom, Iran
Abstract
A hypergraph is given by [Formula: see text], where [Formula: see text] is a set of vertices and [Formula: see text] is a set of nonempty subsets of [Formula: see text], the member of [Formula: see text] is named hyperedge. So, a hypergraph is a nature generalization of a graph. A hypergraph has a complex structure, thus some researchers try to transform a hypergraph to a graph. In this paper, we define two graphs, Clique graph and Persian graph. These relations are one to one. We can find the shortest path between two vertices in a hypergraph [Formula: see text], by using the Dijkstra algorithm in graph theory on the graphs corresponding to [Formula: see text].
Publisher
World Scientific Pub Co Pte Lt
Subject
Discrete Mathematics and Combinatorics
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献