... graph, then the set of vertices of G is denoted by V (G), the set of edges of G byE(G), the cardinality of V (G) by |V (G)|, and the complementary graph of G by G. The subgraph of G induced by ... (2, 2, 4)v, so there must be two 1-cliques and a 3-clique without common vertex in the neighborhood of v in G. Therefore the degree of v in G is at least 5, so δ(G ) 5. Therefore δ(H) 2.Now, ... 4; 5) and G /∈ R(5, 3), then G contains an independentset of order 3.Proof. Since G ∈ Fv(2, 2, 4; 5), then we have G contains no K5. Since G /∈ R(5, 3), thenwe have G contains an independent...