Eccentric Distance Number and Eccentric Distance Sequence in Product Graph

An unordered pair (vᵢ,vⱼ) of vertices is associated with each eᵢ of a graph G, where V is a collection of
vertices (V = {v₁,v₂,v₃,...}) and E is a set of edges (E = {e₁,e₂,e₃,...}). The eccentric distance number (EDN) is the
number of vertices in G that are at maximum separation from vertex vᵢ. The Eccentric Distance Sequence (EDS)
is a list or enumeration of each vertex’s EDN in the graph. Eccentricity is the distance of a farthest vertex from a
given vertex. In this paper EDS of product graph of path graph and complete graph is competitive. Based on the
computation and generalisation of the outcome, the EDS can be further introduced in other fields.