on bipartite divisor graph for character degrees

‎‎the concept of the bipartite divisor graph for integer subsets has been considered in [m‎. ‎a‎. ‎iranmanesh and c‎. ‎e‎. ‎praeger‎, ‎bipartite divisor graphs for integer subsets‎, graphs combin.‎,  26 (2010) 95-105.]‎. ‎in this paper‎, ‎we will consider this graph for the set of character degrees of a finite group $g$ and obtain some properties of this graph‎. ‎we show that if $g$ is a solvable group‎, ‎then the number of connected components of this graph is at most $2$ and if $g$ is a nonsolvable group‎, ‎then it has at most $3$ connected components‎. ‎we also show that‎ ‎the diameter of a connected bipartite divisor graph is bounded by $7$ and obtain some properties of groups whose graphs are complete bipartite graphs‎.