{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T13:10:09Z","timestamp":1753881009396,"version":"3.41.2"},"reference-count":12,"publisher":"World Scientific Pub Co Pte Ltd","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2022,4]]},"abstract":"<jats:p> 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]. <\/jats:p>","DOI":"10.1142\/s1793830921501202","type":"journal-article","created":{"date-parts":[[2021,7,26]],"date-time":"2021-07-26T03:35:13Z","timestamp":1627270513000},"source":"Crossref","is-referenced-by-count":1,"title":["Finding the shortest path for a Hypergraph"],"prefix":"10.1142","volume":"14","author":[{"given":"G. H.","family":"Shirdel","sequence":"first","affiliation":[{"name":"Department of Mathematics, Faculty of Sciences University of Qom, Qom, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Vaez-Zadeh","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Faculty of Sciences University of Qom, Qom, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2021,7,24]]},"reference":[{"issue":"2","key":"S1793830921501202BIB001","first-page":"0","volume":"2","author":"Amin Bahmanian M.","year":"2015","journal-title":"Theory Appl. Graphs"},{"key":"S1793830921501202BIB002","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2"},{"key":"S1793830921501202BIB005","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579216"},{"key":"S1793830921501202BIB007","volume-title":"Ramsey Theory","author":"Graham R. L.","year":"1980","edition":"2"},{"key":"S1793830921501202BIB008","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139004114.004"},{"key":"S1793830921501202BIB009","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2016.03.001"},{"key":"S1793830921501202BIB010","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1722"},{"key":"S1793830921501202BIB011","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2005.12.007"},{"key":"S1793830921501202BIB012","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2004.02.002"},{"key":"S1793830921501202BIB013","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2008.10.005"},{"key":"S1793830921501202BIB014","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2008.09.002"},{"volume-title":"Introduction to Graph and Hypergraph Theory","year":"2009","author":"Voloshin V. L.","key":"S1793830921501202BIB015"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830921501202","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,12]],"date-time":"2022-04-12T09:45:03Z","timestamp":1649756703000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830921501202"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,24]]},"references-count":12,"journal-issue":{"issue":"03","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["10.1142\/S1793830921501202"],"URL":"https:\/\/doi.org\/10.1142\/s1793830921501202","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2021,7,24]]},"article-number":"2150120"}}