Analytic connectivity of k-uniform hypergraphs
classification
🧮 math.CO
keywords
connectivityanalyticgraphuniformadditionalphaboundscomplete
read the original abstract
In this paper, we study the analytic connectivity of a $k$-uniform hypergraph $H$, denoted by $\alpha(H)$. 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.