Eccentric Sequence of Graphs
S. Meenakshi1, Deepika K2, R. Abdul Saleem3
1S. Meenakshi, Associate Professor, Department of Mathematics, VISTAS, Chennai (Tamil Nadu),
2Deepika K, Research Scholar, Department of Mathematics, VISTAS, Chennai (Tamil Nadu), India.
3R. Abdul Saleem, Department of Mathematics, The Quaide Milleth College for Men, Chennai (Tamil Nadu), India.
Manuscript received on 18 January 2020 | Revised Manuscript received on 01 February 2020 | Manuscript Published on 05 February 2020 | PP: 52-54 | Volume-8 Issue-4S5 December 2019 | Retrieval Number: D10221284S519/2019©BEIESP | DOI: 10.35940/ijrte.D1022.1284S519
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: 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).
Keywords: Cartesian Product of Graphs, Degree Sequence of Graphs, Eccentric Sequence of Graphs, Join of A Graph.
Scope of the Article: Cryptography and Applied Mathematics