Analytic connectivity of $k$-uniform hypergraphs
Combinatorics
2015-07-13 v1
Abstract
In this paper, we study the analytic connectivity of a -uniform hypergraph , denoted by . In addition to computing the analytic connectivity of a complete -graph, we present several bounds on analytic connectivity that relate it with other graph invariants, such as degree, vertex connectivity, diameter, and isoperimetric number.
Cite
@article{arxiv.1507.02763,
title = {Analytic connectivity of $k$-uniform hypergraphs},
author = {An Chang and Joshua Cooper and Wei Li},
journal= {arXiv preprint arXiv:1507.02763},
year = {2015}
}
Comments
15 pages