TY - JOUR
A2 - Szekely, Laszlo A.
AU - Singh, Priyanka
AU - Panigrahi, Pratima
PY - 2016
DA - 2016/08/07
TI - On Self-Centeredness of Product of Graphs
SP - 2508156
VL - 2016
AB - A graph G is said to be a self-centered graph if the eccentricity of every vertex of the graph is the same. In other words, a graph is a self-centered graph if radius and diameter of the graph are equal. In this paper, self-centeredness of strong product, co-normal product, and lexicographic product of graphs is studied in detail. The necessary and sufficient conditions for these products of graphs to be a self-centered graph are also discussed. The distance between any two vertices in the co-normal product of a finite number of graphs is also computed analytically.
SN - 1687-9163
UR - https://doi.org/10.1155/2016/2508156
DO - 10.1155/2016/2508156
JF - International Journal of Combinatorics
PB - Hindawi Publishing Corporation
KW -
ER -