On a Traffic Control Problem Using Cut-Set of Graph

A traffic control problem at an intersection can be efficiently modeled as a graph. Cut-set of a graph can be used to study the most efficient route or the traffic control system to direct the traffic flow to its maximum capacity using the minimum number of edges. Let G=(V, E) be a graph and a cut-set F=E(G) of G is called an edge control set of G if every flow of G is completely determined by F. An edge control set F is said to be minimum if F is the least cardinality among all the edge control sets of G. This result has got application in traffic control problems at an arbitrary intersection so as to minimize the waiting time of the traffic participants and the cost of locating the sensors in order to collect traffic data.