In a graph, diametral path is shortest path between two vertices which has length equal to diameter of the graph. Number of diametral paths plays an important role in computer science and civil engineering. In this paper, ...