On the eccentricity value sequence of a simple graph (Q2774285)

The integer sequence of eccentricities of the vertices of a graph is called the eccentric sequence of the graph. The set of integers of this sequence was called the eccentric set of the graph. \textit{L. Lesniak} [Period. Math. Hung. 6, 287-293 (1975; Zbl 0363.05053)] introduced these terms and obtained a recursive necessary and sufficient condition for an eccentric sequence and \textit{M. Behzad} and \textit{J. E. Simpson} [Discrete Math. 16, 187-193 (1976; Zbl 0364.05034)] characterized eccentric sets and determined the minimum order of graphs with given eccentric set. NEWLINENEWLINENEWLINEThe authors of the paper under review seem to be unaware of these references. They call an eccentric set an eccentricity value sequence and obtain essentially the same results about these as Behzad and Simpson. They construct a family of minimum order graphs realizing given eccentricity value sequences and suggest some open problems.