On the eccentricity value sequence of a simple graph
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. The 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.
- On antimode graphs
- scientific article; zbMATH DE number 1158120 (Why is no real title available?)
- scientific article; zbMATH DE number 2157323 (Why is no real title available?)
- Eccentric sequences in stratified graphs
- On eccentricity sequences of connected graphs
- Characterization of eccentric digraphs
- On degree sequences and eccentricities in pseudoline arrangement graphs
This page was built for publication: On the eccentricity value sequence of a simple graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2774285)