AbstractIn this paper we introduce a technique to compute an improved bound on edge-forwarding indices of graphs. Further we prove that the bound is sharp for cylinder, torus and certain trees
Expanding and forwarding are two graphic parameters related to the connectivity and the capacity of ...
AbstractExpanding and forwarding are two graphic parameters related to the connectivity and the capa...
LetG be a connected graph. A routing inG is a set of fixed paths for all ordered pairs of vertices i...
AbstractA network (G,R) consists in a given undirected graph G of order n and a routing R, that is a...
AbstractAnswering some questions of Heydemann, Meyer, Opatrny and Sotteau [4], we give upper bounds ...
AbstractFor a given connected graph G of order n, a routing R is a set of n(n-1) simple paths one sp...
Abstract-A network is defined as an undirected graph and a routing which consists of a collection of...
To measure the efficiency of a routing in network, Chung et al [The forwarding index of communicatio...
A routing R of a connected graph G of order n is a collection of n(n — 1) simple paths connecting ev...
AbstractIn a given network with n vertices, a routing is defined as a set of n(n — 1) paths, one pat...
The decision version of the forwarding index problem is, given a connected graph G and an integer ξ,...
AbstractThe decision version of the forwarding index problem is, given a connected graph G and an in...
In this paper, we give lower bounds of vertex and edge forwarding indices for cartesian product, joi...
Abstract. A routing R of a connected graph G of order n is a collection of n(n − 1) simple paths con...
AbstractFor a given connected graph G of order v, a routing R in G is a set of v(v−1) elementary pat...
Expanding and forwarding are two graphic parameters related to the connectivity and the capacity of ...
AbstractExpanding and forwarding are two graphic parameters related to the connectivity and the capa...
LetG be a connected graph. A routing inG is a set of fixed paths for all ordered pairs of vertices i...
AbstractA network (G,R) consists in a given undirected graph G of order n and a routing R, that is a...
AbstractAnswering some questions of Heydemann, Meyer, Opatrny and Sotteau [4], we give upper bounds ...
AbstractFor a given connected graph G of order n, a routing R is a set of n(n-1) simple paths one sp...
Abstract-A network is defined as an undirected graph and a routing which consists of a collection of...
To measure the efficiency of a routing in network, Chung et al [The forwarding index of communicatio...
A routing R of a connected graph G of order n is a collection of n(n — 1) simple paths connecting ev...
AbstractIn a given network with n vertices, a routing is defined as a set of n(n — 1) paths, one pat...
The decision version of the forwarding index problem is, given a connected graph G and an integer ξ,...
AbstractThe decision version of the forwarding index problem is, given a connected graph G and an in...
In this paper, we give lower bounds of vertex and edge forwarding indices for cartesian product, joi...
Abstract. A routing R of a connected graph G of order n is a collection of n(n − 1) simple paths con...
AbstractFor a given connected graph G of order v, a routing R in G is a set of v(v−1) elementary pat...
Expanding and forwarding are two graphic parameters related to the connectivity and the capacity of ...
AbstractExpanding and forwarding are two graphic parameters related to the connectivity and the capa...
LetG be a connected graph. A routing inG is a set of fixed paths for all ordered pairs of vertices i...
DOI
Add to ORKG