Tight blocking sets in some maximum packings of image Original Research Article

Let image be a image-packing with edge-leave L and a blocking set T. Let image be all connected components of L with at least two vertices (note that image if image). The blocking set T is called tight if further image and image for image. In this paper we give a complete solution for the existence of a maximum image-packing admitting a blocking set (BS), or a tight blocking set (TBS) for any image, and image, kite.