image-equicoverable graphs—Research on image-equicoverable graphs Original Research Article

Let image be a fixed graph. An image-covering of image is a set image of subgraphs of image, where each subgraph image is isomorphic to image and every edge of image appears in at least one member of image. If there exists an image-covering of image, image is called image-coverable. An image-covering of image with image copies image of image is called minimal if, for any image, image is not an image-covering of image. An image-covering of image with image copies image of image is called minimum if there exists no image-covering with less than image copies of H. A graph image is called image-equicoverable if every minimal image-covering in image is also a minimum image-covering in image. In this paper, we investigate the characterization of image-equicoverable graphs.