International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 53 - Number 6 |
Year of Publication: 2012 |
Authors: Arun Kumar Baruah, Niky Baruah |
10.5120/8427-2194 |
Arun Kumar Baruah, Niky Baruah . Clique Matrix of a Graph in Traffic Control Problems. International Journal of Computer Applications. 53, 6 ( September 2012), 41-45. DOI=10.5120/8427-2194
Clique matrix can be used as a graph theoretic tool to study traffic control problem at an intersection. A traffic control problem can be efficiently modelled as a graph where the nodes represent the traffic streams and the edges represent the relationship among the streams. The matrix representation of the control problem is used for phasing of signal groups and thus providing a solution to the control problem. Clique of a graph is defined as maximal complete subgraph and clique matrix of a graph is defined as a generalization of the incidence matrix where the columns correspond to the number of cliques and the rows correspond to the number of vertices of the graph.