Name
Abstract | ||
|---|---|---|
The eccentricity e(v) of a vertex v in a strongly connected digraph G is the maximum distance from v. The eccentricity sequence of a digraph is the list of eccentricities of its vertices given in nondecreasing order. A sequence of positive integers is a digraphical eccentric sequence if it is the eccentricity sequence of some digraph. A set of positive integers S is a digraphical eccentric set if there is a digraph G such that S = {e(v), v is an element of V(G)}. In this paper, we present some necessary and sufficient conditions for a sequence S to be a digraphical eccentric sequence. In some particular cases, where either the minimum or the maximum value of S is fixed, a characterization is derived. We also characterize digraphical eccentric sets. |
Year | Venue | Keywords |
|---|---|---|
2008 | ARS COMBINATORIA | eccentricity, eccentric sequence, eccentric set |
Field | DocType | Volume |
Integer,Discrete mathematics,Combinatorics,Vertex (geometry),Eccentricity (behavior),Strongly connected component,Digraph,Mathematics | Journal | 86 |
ISSN | Citations | PageRank |
0381-7032 | 0 | 0.34 |
References | Authors | |
1 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Joan Gimbert | 1 | 46 | 6.62 |
| Nacho López | 2 | 43 | 9.42 |