Are all biregular graphs connected?

Question

a simple question that I can't really seem to prove. I have a biregular graph (as in a graph with n vertices and each vertex has a degree of 'd') and it is also bipartite. I'd like to prove it is connected, as in there is a path between every two vertices.

Any advice?

Answer 1

It isn’t necessarily true:

                    *       *
                    |       |
                    *       *