{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T11:20:40Z","timestamp":1719832840069},"reference-count":21,"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":[[2020,6]]},"abstract":"<jats:p>This paper considers derivable directed hypergraphs by undirected hypergraphs and generates undirected hypergraphs from directed hypergraphs. It tries to enumerate derivable directed hypergraphs and to find an upper bound for it. We introduce a positive relation on directed hypergraphs and derives digraphs via positive equivalence relation. We consider wireless sensor hypernetworks as directed hypergraphs and by clustering directed hypergraphs and positive equivalence relation obtain wireless sensor networks and show by cluster digraphs.<\/jats:p>","DOI":"10.1142\/s1793830920500305","type":"journal-article","created":{"date-parts":[[2020,1,22]],"date-time":"2020-01-22T07:37:57Z","timestamp":1579678677000},"page":"2050030","source":"Crossref","is-referenced-by-count":2,"title":["\u03b1-Derivable digraphs and its application in wireless sensor networking"],"prefix":"10.1142","volume":"12","author":[{"given":"M.","family":"Hamidi","sequence":"first","affiliation":[{"name":"Department of Mathematics, Faculty of Mathematics, Payame Noor University, Tehran, Iran"}]},{"given":"R.","family":"Ameri","sequence":"additional","affiliation":[{"name":"School of Mathematics, Statistics and Computer Sciences, University of Tehran, Tehran, Iran"}]}],"member":"219","published-online":{"date-parts":[[2020,3,23]]},"reference":[{"key":"S1793830920500305BIB001","volume-title":"Graphs and Hypergraphs","author":"Berge C.","year":"1979"},{"key":"S1793830920500305BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2011.06.004"},{"key":"S1793830920500305BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(93)90045-P"},{"issue":"1","key":"S1793830920500305BIB004","first-page":"139","volume":"43","author":"Hamidi M.","year":"2019","journal-title":"Kragujevac J. Math."},{"issue":"2","key":"S1793830920500305BIB006","first-page":"21","volume":"8","author":"Hamidi M.","year":"2019","journal-title":"Trans. Combin."},{"key":"S1793830920500305BIB007","doi-asserted-by":"publisher","DOI":"10.1007\/s12190-017-1098-z"},{"key":"S1793830920500305BIB008","doi-asserted-by":"publisher","DOI":"10.1142\/S1793005718500114"},{"issue":"7","key":"S1793830920500305BIB009","first-page":"1735","volume":"6","author":"Liu X.","year":"2012","journal-title":"KSII Tans. Internet Inf. Syst."},{"key":"S1793830920500305BIB010","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-016-9534-2"},{"key":"S1793830920500305BIB011","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2007.05.001"},{"key":"S1793830920500305BIB012","doi-asserted-by":"publisher","DOI":"10.3390\/s120100806"},{"key":"S1793830920500305BIB013","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.02.038"},{"key":"S1793830920500305BIB014","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2004.04.002"},{"key":"S1793830920500305BIB015","doi-asserted-by":"publisher","DOI":"10.1007\/s11277-014-1748-5"},{"key":"S1793830920500305BIB016","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.02.006"},{"key":"S1793830920500305BIB017","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2008.04.002"},{"key":"S1793830920500305BIB018","doi-asserted-by":"crossref","unstructured":"D. Zhouy, J. Huangz and B. Scholkopf , Learning with Hypergraphs: Clustering, Classification, and Embedding (MIT Press, 2006), pp. 1601\u20131608.","DOI":"10.7551\/mitpress\/7503.003.0205"},{"key":"S1793830920500305BIB019","author":"Zhan J.","year":"2018","journal-title":"Artificial Intell. Rev."},{"key":"S1793830920500305BIB020","author":"Zhan J.","year":"2018","journal-title":"Artificial Intell. Rev."},{"key":"S1793830920500305BIB021","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2016.09.012"},{"key":"S1793830920500305BIB022","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2017.03.038"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830920500305","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T13:10:40Z","timestamp":1695647440000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830920500305"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,23]]},"references-count":21,"journal-issue":{"issue":"03","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["10.1142\/S1793830920500305"],"URL":"https:\/\/doi.org\/10.1142\/s1793830920500305","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,23]]}}}