Open AccessEccentric Sequence of Graphs
Author(s) -
S. Meenakshi,
R. Abdul Saleem
Publication year - 2020
Publication title -
international journal of recent technology and engineering
Language(s) - English
Resource type - Journals
ISSN - 2277-3878
DOI - 10.35940/ijrte.d1022.1284s519
Subject(s) - combinatorics , mathematics , vertex (graph theory) , graph , cartesian product , discrete mathematics , wheel graph , graph power , line graph
The distance d(u, v) from a vertex u of graph G to a vertex v is the length of a shortest u to v path. The eccentric sequences were the first distance related sequences introduced for undirected graphs. The eccentricity e(v) of v is the distance of a farthest vertex from v. The eccentric sequence of a graph G is a list of the eccentricities of vertices of graph G arranged in non-decreasing order. In this paper we determine the eccentric sequence of join of an empty graph and path graph(ie fan graph) and the eccentric sequence of the Cartesian product of paths P2 and Pn (ie Ladder graph).