Transit Index of a Graph: A New Perspective.
Saved in:
| Title: | Transit Index of a Graph: A New Perspective. |
|---|---|
| Authors: | Asharaf, P. A.1 asharafpa@gecwyd.ac.in, Thomas, Bindhu K.2 bindhukthomas@gmail.com |
| Source: | IAENG International Journal of Applied Mathematics. Apr2026, Vol. 56 Issue 4, p1384-1390. 7p. |
| Subjects: | Graph theory, Mathematical notation |
| Abstract: | The transit index of a graph is an important distance-based graph invariant in graph theory. Analytical expressions for this index are known only for certain families of graphs. In this paper, we propose a unified matrix-based approach for computing the transit index of any simple, connected, undirected graph. The method incorporates both distance information and the multiplicity of shortest paths, resulting in a concise and efficient procedure for computing the transit index. In addition, a new graph index, termed the edge transit index, is introduced, and an explicit formula for the total edge transit index is derived. [ABSTRACT FROM AUTHOR] |
| Copyright of IAENG International Journal of Applied Mathematics is the property of International Association of Engineers (IAENG) and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
Be the first to leave a comment!
