Some diameter notions in lexicographic product

Chithra MR (Department of Mathematics Cochin University of Science and Technology, Cochin-682022, India)
Manju K Menon (Department of Mathematics St. Paul’s College, Kalamassery-683503, India)
A. Vijayakumar (Department of Mathematics Cochin University of Science and Technology, Cochin-682022, India)

Electronic Journal of Graph Theory and Applications (EJGTA)
Vol 6, No 2 (2018): Electronic Journal of Graph Theory and Applications

Many graphs such as hypercubes, star graphs, pancake graphs, grid, torus etc are known to be good interconnection network topologies. In any network topology, the vertices represent the processors and the edges represent links between the processors. Two most important criteria - efficiency and reliability of network models - can be studied with the help of graph theoretical techniques. The lexicographic product is a well studied graph product. The distance notions such as various diameters of a graph help to analyze the efficiency of any interconnection network. In this paper, we study some distance notions such as wide diameter, diameter variability and diameter vulnerability of lexicographic products that are useful in the design of interconnection networks.