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 v...
We prove the non-existence of maximal partial spreads of size 76 in PG(3, 9). Relying on the classification of the minimal blocking sets of size 15 in PG(2, 9) [22], we show that ...
Given a graph G, we say S V (G) is resolving if for each pair of distinct u, v V (G) there is a vertex x in S where d(u, x) = d(v, x). The metric dimension of G is the minimum c...