Two recursive inequalities for crossing numbers of graphs

In this paper, two recursive inequalities for crossing numbers of graphs are given by using basic counting method. As their applications, the crossing numbers of K 1,3,n and K 4,n \ e are determined, respectively.