Inverse Perron Values and Connectivity of a Uniform Hypergraph

Electronic Journal Of Combinatorics

Changjiang Bu¹ 

关键词: Hypergraph;    Inverse Perron value;    Laplacian tensor;    Connectivity;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

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

【 授权许可】

Others