Open AccessDiametral Paths in Total Graphs of Paths, Cycles and Stars
Author(s) -
Tabitha Agnes Mangam,
Joseph Varghese Kureethara
Publication year - 2018
Publication title -
international journal of engineering and technology
Language(s) - English
Resource type - Journals
ISSN - 2227-524X
DOI - 10.14419/ijet.v7i4.10.21286
Subject(s) - combinatorics , adjacency list , mathematics , path graph , vertex (graph theory) , graph , discrete mathematics , graph power , line graph
The diametral path of a graph is the shortest path between two vertices which has length equal to diameter of that graph. Total graph of a graph is a graph that has vertices representing all vertices and edges of the original graph and edges representing every vertex-vertex adjacency, edge-edge adjacency and edge-vertex incidence. In this paper, the number of diametral paths is determined for the paths, cycles and stars and their total graphs.