AbstractExpanding and forwarding are two graphic parameters related to the connectivity and the capacity of the network—the undirected graph with a given routing. Many large networks are composed from some existing smaller networks by using, in terms of graph theory, Cartesian product. The expanding and forwarding parameters of such large networks are associated strongly with that of the corresponding smaller ones. This association also provides a convenient way to determine the two parameters for some known networks such as the hypercube, generalized cube and the mesh, etc. As the generalization of the forwarding index, t-forwarding index is introduced and studied. The study shows that the t-forwarding parameters of a given graph are conve...
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...
AbstractA routing R in a graph G is a set of paths {Rxy : x, y ϵ V(G)} where, for each ordered pair ...
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...
Abstract. For a given connected graph G of order n, a routing R is a set of n(n − 1) elementary path...
AbstractA network (G,R) consists in a given undirected graph G of order n and a routing R, that is a...
Abstract-A network is defined as an undirected graph and a routing which consists of a collection of...
AbstractFor a given connected graph G of order n, a routing R is a set of n(n-1) simple paths one sp...
To measure the efficiency of a routing in network, Chung et al [The forwarding index of communicatio...
AbstractFor a given connected graph G of order v, a routing R in G is a set of v(v−1) elementary pat...
AbstractIn this paper we introduce a technique to compute an improved bound on edge-forwarding indic...
A routing R of a connected graph G of order n is a collection of n(n — 1) simple paths connecting ev...
In this paper, we give lower bounds of vertex and edge forwarding indices for cartesian product, joi...
AbstractAnswering some questions of Heydemann, Meyer, Opatrny and Sotteau [4], we give upper bounds ...
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...
AbstractA routing R in a graph G is a set of paths {Rxy : x, y ϵ V(G)} where, for each ordered pair ...
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...
Abstract. For a given connected graph G of order n, a routing R is a set of n(n − 1) elementary path...
AbstractA network (G,R) consists in a given undirected graph G of order n and a routing R, that is a...
Abstract-A network is defined as an undirected graph and a routing which consists of a collection of...
AbstractFor a given connected graph G of order n, a routing R is a set of n(n-1) simple paths one sp...
To measure the efficiency of a routing in network, Chung et al [The forwarding index of communicatio...
AbstractFor a given connected graph G of order v, a routing R in G is a set of v(v−1) elementary pat...
AbstractIn this paper we introduce a technique to compute an improved bound on edge-forwarding indic...
A routing R of a connected graph G of order n is a collection of n(n — 1) simple paths connecting ev...
In this paper, we give lower bounds of vertex and edge forwarding indices for cartesian product, joi...
AbstractAnswering some questions of Heydemann, Meyer, Opatrny and Sotteau [4], we give upper bounds ...
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...
AbstractA routing R in a graph G is a set of paths {Rxy : x, y ϵ V(G)} where, for each ordered pair ...