Open Access

## K. Deepika, K. Suriya, S. Meenakshi

DOI:  https://doi.org/10.37418/amsj.9.11.37

#### Full Text

The minimum length in a graph G between two vertices is defined to be the distance between the two vertices and is denoted by d$\left(a,b\right)$.  The farthest vertex distance from a vertex ‘a’ is known as the eccentricity e(a) of the vertex ‘a’. Enumerating the vertex eccentricities in an increasing order is defined as the eccentricity sequence or eccentric sequence of the graph G [11].  The eccentric sequence of some graphs is computed in this paper.

Keywords: Degree sequence, Eccentricity sequence.