Matrix Methods for Connectivity and Reachability in Transportation Networks

Samridhi Upadhyay *

Department of Mathematics, Institute for Excellence in Higher Education, Bhopal, India.

Manoj Ughade

Department of Mathematics, Institute for Excellence in Higher Education, Bhopal, India.

*Author to whom correspondence should be addressed.


Abstract

This paper presents a matrix-based approach for modelling and analysing transportation networks using concepts from graph theory and linear algebra. The incidence matrix and its transformation into the adjacency matrix through the product MMT are employed to represent structural relationships within the network. Matrix operations and their powers are used to study both direct and indirect connectivity, while the reachability matrix provides an effective algebraic criterion for determining accessibility among nodes. The theoretical results establish a connection between matrix formulations and graph connectivity, offering a systematic framework for network analysis. The applicability of the proposed method is demonstrated through several transportation models, including regional and large-scale networks, where key hubs, connectivity patterns, and efficiency are identified. The study shows that matrix-based techniques provide a scalable and practical tool for transportation planning, route optimization, and analysis of complex network systems.

Keywords: Graph theory, matrix analysis, adjacency matrix, incidence matrix, transportation networks, reachability analysis, network connectivity, spectral graph theory, complex network systems, optimization


How to Cite

Upadhyay, Samridhi, and Manoj Ughade. 2026. “Matrix Methods for Connectivity and Reachability in Transportation Networks”. Asian Research Journal of Mathematics 22 (4):312-29. https://doi.org/10.9734/arjom/2026/v22i41082.

Downloads

Download data is not yet available.