On Self-Centeredness of Product of Graphs | Zendy

Priyanka Singh | Zendy; Pratima Panigrahi | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

On Self-Centeredness of Product of Graphs

Author(s) -

Priyanka Singh,

Pratima Panigrahi

Publication year - 2016

Publication title -

international journal of combinatorics

Language(s) - English

Resource type - Journals

eISSN - 1687-9171

pISSN - 1687-9163

DOI - 10.1155/2016/2508156

Subject(s) - graph product , combinatorics , mathematics , graph , vertex (graph theory) , lexicographical order , symmetric graph , discrete mathematics , voltage graph , line graph , 1 planar graph

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research