Do you perhaps mean complete bipartite graph?
Otherwise, there is no one formula, but a range of formulae.
I am suppose to come up with a formula for the number of edges in a bipartite graph with n vertices in one partition and and m vertices in the second partition. I need some help!!!!
I am thinking that I would need to take 2^n and 2^m and then divide by something but I am not sure... Any guidance would be appreciated. Thank you all for caring about struggling math students!
Yes, although the problem does not specify this the picture shown does have a title which states that it is a complete bipartite graph. So I need to come up with a formula for the number of edges in a complete bipartite graph with m vertices in one partition and n vertices in the other partition.