An undirected graph G is a bipartite graph if and only if G has at least two vertices and all its cycles are even in length.
Obviously, in Figure (a), the length of the circle is 4, 6 and 8, which are even numbers, so it is a bipartite graph!