On Self-Centeredness of Product of Graphs
2016 ◽
Vol 2016
◽
pp. 1-4
◽
Keyword(s):
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.
1966 ◽
Vol 62
(2)
◽
pp. 149-164
◽
2010 ◽
Vol 270
(1)
◽
pp. 194-215
◽
1974 ◽
Vol 26
(5)
◽
pp. 1242-1244
◽
2010 ◽
Vol 62
(4)
◽
pp. 870-888
◽
1991 ◽
Vol 69
(1)
◽
pp. 227-253
◽
2018 ◽
Vol 37
(4)
◽
pp. 9