{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,15]],"date-time":"2025-12-15T04:25:59Z","timestamp":1765772759327},"reference-count":12,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2017,8]]},"abstract":"<jats:p> Let [Formula: see text] be a connected [Formula: see text]-uniform hypergraph. The unique positive eigenvector [Formula: see text] with [Formula: see text] corresponding to spectral radius [Formula: see text] is called the principal eigenvector of [Formula: see text]. In this paper, we present some lower bounds for the spectral radius [Formula: see text] and investigate the bounds of entries of the principal eigenvector of [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s1793830917500483","type":"journal-article","created":{"date-parts":[[2017,7,3]],"date-time":"2017-07-03T08:25:50Z","timestamp":1499070350000},"page":"1750048","source":"Crossref","is-referenced-by-count":2,"title":["On the spectral radii and principal eigenvectors of uniform hypergraphs"],"prefix":"10.1142","volume":"09","author":[{"given":"Xuelian","family":"Si","sequence":"first","affiliation":[{"name":"Department of Mathematics, Shanghai University, Shanghai 200444, P. R. China"}]},{"given":"Xiying","family":"Yuan","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Shanghai University, Shanghai 200444, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2017,8,16]]},"reference":[{"key":"S1793830917500483BIB001","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-00080-0"},{"key":"S1793830917500483BIB002","doi-asserted-by":"publisher","DOI":"10.4310\/CMS.2008.v6.n2.a12"},{"key":"S1793830917500483BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2011.11.018"},{"key":"S1793830917500483BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2011.02.042"},{"key":"S1793830917500483BIB005","doi-asserted-by":"publisher","DOI":"10.1002\/mana.19881390105"},{"key":"S1793830917500483BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(99)90280-7"},{"key":"S1793830917500483BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2016.09.015"},{"key":"S1793830917500483BIB008","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2014.05.005"},{"key":"S1793830917500483BIB009","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2005.05.007"},{"key":"S1793830917500483BIB010","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2013.03.015"},{"key":"S1793830917500483BIB011","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2013.07.010"},{"key":"S1793830917500483BIB013","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2005.03.020"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830917500483","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T17:03:05Z","timestamp":1565110985000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830917500483"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8]]},"references-count":12,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2017,8,16]]},"published-print":{"date-parts":[[2017,8]]}},"alternative-id":["10.1142\/S1793830917500483"],"URL":"https:\/\/doi.org\/10.1142\/s1793830917500483","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,8]]}}}