Open AccessThe Implementation of Bipartite Graph To Minimize Crossing Number Problem of Crossroads in Manado
Author(s) -
Timboeleng Axellica Nazareth,
Chriestie Montolalu,
Benny Pitoan
Publication year - 2019
Publication title -
d'cartesian: jurnal matematika dan aplikasi/d ' cartesian
Language(s) - English
Resource type - Journals
eISSN - 2685-1083
pISSN - 2302-4224
DOI - 10.35799/dc.8.2.2019.24240
Subject(s) - bipartite graph , combinatorics , foster graph , complete bipartite graph , mathematics , voltage graph , vertex (graph theory) , edge transitive graph , line graph , graph , crossing number (knot theory) , discrete mathematics , intersection (aeronautics) , engineering , aerospace engineering
The Implementation Of Bipartite Graph To Minimize Crossing Number Problem Of Crossroads In Manado. Supervised by BENNY PINONTAN as main supervisor and CHRIESTIE E. J. C. MONTOLALU as co-supervisor. In general, the crossroads are the meeting points of two-way roads from four different places. This causes cross direction at that point. There are various methods that can be used to minimize the crossing number problem crossroad, for example graph theory. The ability of graph theory can later help describe crossroads in Manado into graph, with nodes and lines. In this case, the crossing number problems will solve by bipartite graph. Bipartite graph is a graph that does not have an odd cycle, and can be partitioned into two parts of a set of vertices. Based on results of this research, the appropriate form of the bipartite graph is and in two different form. First, with an isolated vertex, and second, without isolated vertex. In the case of crossroads, Bipartite graph turns out to be one method that is very suitable and helps determine the crossing number and its solution quickly.