<abstract><p>The article deals with some theoretical aspects of hypergraph connectivity from the knot view. The strength of knots is defined and investigates some of their properties. We introduce the concept of cut knot and investigate its importance in the connectivity of hypergraphs. We also introduce the concept of hypercycle in terms of knot hyperpath and establish a sufficient condition for a hypergraph to be a hypertree in terms of the strength of knots. Cyclic hypergraph is defined in terms of a permutation on the set of hyperedges and could be an interesting topic for investigation in the sense that it can be linked with the notion of a permutation group. An algorithm is modelled to construct a tree and hypertree from the strength of knots of a hypertree. Lastly, a model of a hypergraph is constructed to control the spread of infection for an infectious disease with the help of the strength of knots.</p></abstract>