proposing a pure binary linear programming (pblp) model to discover eulerian circuits in complete graphs

Known as a branch of discrete mathematics (dm), the graph theory (gt) describes and solves problems of discrete nature through nodes (i.e., vertices) and arcs (i.e., edges). in this regard, a prominent problem is to find the eulerian circuits. this paper indicates that the problem can be analyzed through operations research methods. in more general terms, finding the eulerian circuits could be considered a pathfinding problem. hence, this paper proposes a pure binary mathematical model to describe the relationship between the variables employed to find the eulerian circuits. all the analyses in this paper were performed in matlab. the proposed model can be solved by many optimization software applications. finally, several numerical examples are presented and solved through the proposed method. all the analyses in this paper were performed in matlab. this paper indicated that the problem(eulerian circuits in complete graphs) could be studied and solved from the perspective of operations research.