1PhD Fellow, Department of Information and Computer Sciences, Saitama University, Saitama, Japan
2Associate Professor, Department of Computer Science and Engineering, Jatiya Kabi Kazi Nazrul Islam University, Mymensingh, Bangladesh
3Professor, Department of Computer Science and Information Technology, University of Fiji, Lautoka, Fiji
*(*Corresponding author) Email id: saifulmath@yahoo.com
Bipartite graph is widely popular to find the maximal matching which helps to reduce the computational cost. In this research, we have introduced three new algorithms of bipartite and complete bipartite graph detection. First, adjacency-list merging algorithm, second, distinct set algorithm and finally adjacency-square matrix algorithm. Our approach is based on the concept of set theory for the first two algorithms and matrix operation for the last algorithm to detect these graphs. It is very hard to check manually whether a graph is bipartite or not. There are numerous applications of bipartite graph in mathematics and graph theory. Therefore, this will help to novice researchers in the area of graph theory. Here, we also have evaluated the performance of these algorithms by applying about hundreds of complex graphs where the detection accuracy is 100%.
Bipartite, Graph, Detection, Algorithm, Technique
