Abstract
In this paper, we study the analytic connectivity of a k-uniform hypergraph H, denoted by . In addition to computing the analytic connectivity of a complete k-graph, we present several bounds on analytic connectivity that relate it with other graph invariants, such as degree, vertex connectivity, diameter and isoperimetric number.
Acknowledgements
We would like to thank Professor Liqun Qi for his help and guidance. We also wish to thank the referee for giving several valuable comments and suggestions.
Notes
No potential conflict of interest was reported by the authors.