Infinite Family of Ramsey (K 1,2, C 4) minimal Graphs
Suppose F, G, and H be simple graphs. We let F (G, H) denote red blue coloring of edges of F containing either red G or blue H. The graph F is considered Ramsey (G, H) minimal if F (G, H) and F e (G, H) for arbitrary edge e of E(F The set of (G, H) minimal graphs is denoted by R(G, H) In this paper, we study an infinite family of graphs belongs to R(K 1,2, C 4)