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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.