International Journal of Mathematics Trends and Technology
Volume 65 | Issue 6 | Year 2019 | Article Id. IJMTT-V65I6P509 | DOI : https://doi.org/10.14445/22315373/IJMTT-V65I6P509
K. V. S. Sarma, I.V.N. Uma, I.H. N. Rao, "An Extension of the Paper “Maximum Distance in Graphs”," International Journal of Mathematics Trends and Technology (IJMTT), vol. 65, no. 6, pp. 54-60, 2019. Crossref, https://doi.org/10.14445/22315373/IJMTT-V65I6P509
Thamarai Selvi and Vaidyanathan [1] introduced the concept of Maximum distance (M – distance) in a graph. They claimed a few relations between the (usual) metric distance and M – distance related to a graph. Further, they defined M – Eccentricity, M – Radius, M – Diameter and M – Denter related to a graph and obtained them for a few standard graphs. In this paper, we made improvements for a considerable number of results of the above mentioned paper. Our paper is divided into three sections. The first one deals with introduction and basic results; the middle one for the calculation of dM (u, v) (M-distance) for all pairs of vertices u, v of the graphs Kn, Sn and Km,n for suitable m, n and to P2 , P3 . The last section is devoted with the calculations of M-Eccentricity etc. of the above mentioned graphs.
[1] Thamarai Selvi, Vaidyanathan, „Maximum distance in Graphs, Int.Jour of Maths. Trends and Technology (IJMTT), Vol.58, June 2018, pp 16-19.
PDF 
Citation 
Abstract 
Keywords 
References