Table of Contents
International Journal of Combinatorics
Volume 2016 (2016), Article ID 2508156, 4 pages
http://dx.doi.org/10.1155/2016/2508156
Research Article

On Self-Centeredness of Product of Graphs

Department of Mathematics, Indian Institute of Technology Kharagpur, Kharagpur 721302, India

Received 4 April 2016; Revised 28 June 2016; Accepted 12 July 2016

Academic Editor: Laszlo A. Szekely

Copyright © 2016 Priyanka Singh and Pratima Panigrahi. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

A graph 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.