An algorithm for a special graph

Most of practical problems which call for graph theory involve large graphs - graphs that are virtually impossible for hand computation. In fact, one of the reasons for the recent growth of interest in graph theory has been the arrival of the high-speed electronic computer. In this paper, we propose an algorithm which take the advantages of computing power gained from a machine with parallel architecture - A shared memory split bus system. The algorithm is to perform multiplications of adjacency matrices for a given graph using such system. Therefore, it determines whether the graph is a bipartite or not based on the existence of odd cycles in the graph. The simulation model for such an algorithm has shown some favorable results.