Restricted size Ramsey number for 2K2 versus disconnected graphs of order six

Given simple graphs F, G, and H. We say F arrows (G, H) if for any red-blue coloring of the edge of F, we find either a red-colored graph G or a blue-colored graph H. The Ramsey number r(G, H) is the smallest positive integer r such that a complete graph K,r arrows (G, H). The size Ramsey number is the smallest positive integer r such that a graph F with the size of r arrows (G, H). The restricted size Ramsey number is the smallest positive integer r∗ such that a graph size Ramsey F, of order number r(G, of H) a matching with the size of two of r edges ∗, arrows and (any G, H disconnected ). In this paper graphs we give of order the restricted six with no isolates.