{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:44:15Z","timestamp":1753893855352,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>In this paper, we show that a uniform hypergraph $\\mathcal{G}$ is connected if and only if one of its inverse Perron values is larger than $0$. We give some bounds on the bipartition width, isoperimetric number and eccentricities of $\\mathcal{G}$ in terms of inverse Perron values. By using the inverse Perron values, we give an estimation of the edge connectivity of a $2$-design, and determine the explicit edge connectivity of a symmetric design. Moreover, relations between the inverse Perron values and resistance distance of a connected graph are presented.\u00a0\u00a0<\/jats:p>","DOI":"10.37236\/7410","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T15:04:33Z","timestamp":1578668673000},"source":"Crossref","is-referenced-by-count":5,"title":["Inverse Perron Values and Connectivity of a Uniform Hypergraph"],"prefix":"10.37236","volume":"25","author":[{"given":"Changjiang","family":"Bu","sequence":"first","affiliation":[]},{"given":"Haifeng","family":"Li","sequence":"additional","affiliation":[]},{"given":"Jiang","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2018,11,2]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v25i4p28\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v25i4p28\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T04:21:55Z","timestamp":1579234915000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v25i4p28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,2]]},"references-count":0,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2018,10,5]]}},"URL":"https:\/\/doi.org\/10.37236\/7410","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2018,11,2]]},"article-number":"P4.28"}}