Efficient and resilient metro rail networks through graph domination, connectivity, and coloring methods

The utilization of the Indian rail system has grown at a very high rate and there is one of the largest train track networks in the world in the country. Despite the creation of various sophisticated means of transport, congestion, inefficiency and bad connectivity remain factors to contend with. To overcome these challenges, the metro rail has beendiscovered to be the most possible urban mass transit system and can be easily modeled using graph theory with vertices represented by stations and edges by tracks. In this paper, we begin by examining traditional metrics like connectivity, complexity, diameter,average distance between the terminals and potential expansion of the network in the hopeof quantifying passenger convenience and efficiency. We also advance the research withnew concepts: vertex and edge domination are used to compute the minimum criticalstation for effective surveillance, vertex and edge connectivity to quantify survivability against failure and labeling or coloring techniques for use with scheduling, traffic control and resource allocation. This joint approach results in both classical and new findings for more resilient metro network planning and construction.

Keywords:

Graph Theory , Metro Networks , Domination Theory , network resilience , Urban transportation