WorksMathematics
The isolation number of uniform hypertrees
Abstract
An isolating set of a hypergraph is a vertex set whose closed neighbourhood intersects every edge of . The isolation number is the minimum cardinality of such a set. Let , and let be an -uniform hypergraph whose incidence graph is a tree. We prove that, if has order and at least two edges, then . The bound is attained at every admissible order. We characterize all hypertrees attaining it by a construction using six types of marked hypertrees of orders , and . The proof uses a packing formula for the isolation number and an exact identity for the difference . For connected graphs of order with at least two blocks, all of which are triangles, we obtain the sharp bound on the cycle isolation number and characterize the graphs attaining it.