Some Results on the Eccentric Sequence of Graphs
S. Meenakshi1,  Deepika K2

1Deepika K, Research Scholar, Department of Mathematics, VISTAS, Chennai (Tamil Nadu), India.
2S. Meenakshi, Associate Professor, Department of Mathematics, VISTAS, Chennai (Tamil Nadu), India.
Manuscript received on 18 January 2020 | Revised Manuscript received on 01 February 2020 | Manuscript Published on 05 February 2020 | PP: 55-57 | Volume-8 Issue-4S5 December 2019 | Retrieval Number: D10231284S519/2019©BEIESP | DOI: 10.35940/ijrte.D1023.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 (

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 degree of the vertex u is the number of vertices at distance one. The sequence of numbers of vertices having 0,1,2,3,… is called the degree sequence, which is the list of degrees of vertices of G arranged in non-decreasing order. The eccentricity e(a) of a is the distance of a farthest vertex from a. Let G be a connected graph. The Eccentric Sequence of G is the list of the eccentricities of its vertices arranged in non-decreasing order. In this paper, we characterize the eccentric sequence of some of the derived graphs namely the line graph of the integral graph , the eccentric sequence of Mycieleskian of a graph.
Keywords: Degree Sequence of Graphs, Eccentric Sequence of Graphs, Line Graph of A Graph, Mycieleskian of A Graph.
Scope of the Article: Cryptography and Applied Mathematics