New mathematical model to find the shortest path based on Boolean algebra operations for networks

A common question concerning the graph theory is how to find the shortest paths between two vertices, thus covering a wide range of research areas. So far, almost all previous studies have used Algorithms to find such path. However, this consumes more or large search spaces, and it tends to be more complex. Therefore, this paper presents a new mathematical method to finding the shortest path in an undirected graph. The method involves only Boolean algebra to reduce the search space and computational complexity. This method is simple and even faster than linear programming.