Characterizing defect image-extendable bipartite graphs with different connectivities Original Research Article

A near perfect matching is a matching saturating all but one vertex in a graph. If image is a connected graph and any image independent edges in image are contained in a near perfect matching where image is a positive integer and image, then image is said to be defect image-extendable. This paper first shows that the connectivity of defect image-extendable bipartite graphs can be any integer. Then it characterizes defect image-extendable bipartite graph image with image, image and image, respectively. Some properties for defect image-extendable bipartite graphs with different connectivities are also given.