ALGORITHM FOR IDENTIFYING -BIPARTITE GRAPHS
The objective of the present paper is to provide an algorithm to identify if the given graph is -bipartite. In the process, we investigate some interesting properties of -bipartite graphs.
-bipartite graphs, distance-k graph -colorable graph, neighborhood of a vertex.