Goodman([3]) presented the question of finding a best possible upper bound of the form $t(G);+;t(G^c)$, where t(G) denote the number of triangles in given graph G. In this, the form of squares of degrees is appeared and many researches have been pursued as an application related to this. Here, we would like to deal with corollary related to the results of Nikiforov([6]).