A k-regular bipartite graph is the one in which degree of each vertices is k for all the vertices in the graph. Given th
Posted: Wed Jul 13, 2022 6:16 pm
a) Number of vertices in U=Number of vertices in V
b) Number of vertices in U not equal to number of vertices in V
c) Number of vertices in U always greater than the number of vertices in V
d) Nothing can be said
b) Number of vertices in U not equal to number of vertices in V
c) Number of vertices in U always greater than the number of vertices in V
d) Nothing can be said