Inverse Perron values and connectivity of a uniform hypergraph
Combinatorics
2017-11-28 v1
Abstract
In this paper, we show that a uniform hypergraph is connected if and only if one of its inverse Perron values is larger than . We give some bounds on the bipartition width, isoperimetric number and eccentricities of in terms of inverse Perron values. By using the inverse Perron values, we give an estimation of the edge connectivity of a -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.
Cite
@article{arxiv.1711.09655,
title = {Inverse Perron values and connectivity of a uniform hypergraph},
author = {Changjiang Bu and Haifeng Li and Jiang Zhou},
journal= {arXiv preprint arXiv:1711.09655},
year = {2017}
}