Given a graph G = (V; E) we define ¯ e(X), the mean eccentricity of a vertex X, as the average distance from X to all the other vertices of the graph. The computation of this parameter appears to be nontrivial in the case of the de Bruijn networks. In this paper we consider upper and lower bounds for ¯ e(X). For the directed de Bruijn network, we provide tight bounds as well as the extremal vertices which reach these bounds. These bounds are expressed as the diameter minus some constants. In the case of undirected networks, the computation turns out to be more difficult. We provide lower and upper bounds which differ from the diameter by some small constants. We conjecture that the vertices of the form a \Delta \Delta \Delta a have the larg...
Graph theory and its wide applications in natural sciences and social sciences open a new era of res...
AbstractThe Randić index R(G) of a graph G is defined by R(G)=∑uv1d(u)d(v), where d(u) is the degree...
In this paper, we introduce the first and second distance eccentricity Zagreb indices of a connected...
Given a graph G = (V,E) we define e(X), the mean eccentricity of a vertex X, as the average distance...
The eccentricity of a node in a graph is defined as the length of a longest shortest path starting a...
The eccentricity of a node v in a network is the maximum distance from v to any other node. In socia...
AbstractThe eccentricity of a vertex is the maximum distance from it to another vertex and the avera...
The eccentricity of a node v in a network is the maximum distance from v to any other node. In socia...
Abstract. The eccentricity of a vertex is the maximum distance from it to another vertex and the ave...
The eccentricity of a vertex is the maximum distance from it to any other vertex and the average ecc...
The eccentricity of a vertex v in a graph G is the maximum distance between v and any other vertex ...
In this thesis, we consider the problem of computing approximations of extremal distances in undirec...
International audienceWe show that the eccentricities (and thus the centrality indices) of all verti...
We provide new bounds for the approximation of extremal distances (the diameter, the radius, and the...
The adjacent eccentric distance sum index of a graph G is defined as ξsv(G) = v∈V (G) ε(v)D(v) deg(v...
Graph theory and its wide applications in natural sciences and social sciences open a new era of res...
AbstractThe Randić index R(G) of a graph G is defined by R(G)=∑uv1d(u)d(v), where d(u) is the degree...
In this paper, we introduce the first and second distance eccentricity Zagreb indices of a connected...
Given a graph G = (V,E) we define e(X), the mean eccentricity of a vertex X, as the average distance...
The eccentricity of a node in a graph is defined as the length of a longest shortest path starting a...
The eccentricity of a node v in a network is the maximum distance from v to any other node. In socia...
AbstractThe eccentricity of a vertex is the maximum distance from it to another vertex and the avera...
The eccentricity of a node v in a network is the maximum distance from v to any other node. In socia...
Abstract. The eccentricity of a vertex is the maximum distance from it to another vertex and the ave...
The eccentricity of a vertex is the maximum distance from it to any other vertex and the average ecc...
The eccentricity of a vertex v in a graph G is the maximum distance between v and any other vertex ...
In this thesis, we consider the problem of computing approximations of extremal distances in undirec...
International audienceWe show that the eccentricities (and thus the centrality indices) of all verti...
We provide new bounds for the approximation of extremal distances (the diameter, the radius, and the...
The adjacent eccentric distance sum index of a graph G is defined as ξsv(G) = v∈V (G) ε(v)D(v) deg(v...
Graph theory and its wide applications in natural sciences and social sciences open a new era of res...
AbstractThe Randić index R(G) of a graph G is defined by R(G)=∑uv1d(u)d(v), where d(u) is the degree...
In this paper, we introduce the first and second distance eccentricity Zagreb indices of a connected...