Diametral paths in total graphs of complete graphs, complete bipartite graphs and wheels
Central vertex; Diameter; Diametral path; Peripheral vertex; Total graph
The diametral path of a graph is the shortest path between two vertices which has length equal to diameter of that graph. In raising of structures with columns and beams in Civil Engineering, determining of diametral paths is of great significance. In this paper, the number of diametral paths is determined in complete graphs, complete bipartite graphs, wheels and their total graphs. IAEME Publication.
International Journal of Civil Engineering and Technology, Vol-8, No. 5, pp. 1212-1219.
Mangam T.A., Department of Mathematics, Christ University, Bengaluru, Karnataka, India; Kureethara J.V., Department of Mathematics, Christ University, Bengaluru, Karnataka, India