Forwarding indices of folded n-cubes

Authors:
Xinmin Hou;Min Xu;Jun-Ming Xu
Affiliations:
Department of Mathematics, University of Science and Technology of China, Hefei, Anhui, 230026, PR China;Department of Mathematics, University of Science and Technology of China, Hefei, Anhui, 230026, PR China;Department of Mathematics, University of Science and Technology of China, Hefei, Anhui, 230026, PR China
Venue:
Discrete Applied Mathematics
Year:
2005

Citing 9
Cited 6

The forwarding index of communication networks

IEEE Transactions on Information Theory
On forwarding indices of networks

Discrete Applied Mathematics
The forwarding index of communication networks with given connectivity

Discrete Applied Mathematics - Special double volume: interconnection networks
Forwarding indices of k-connected graphs

Discrete Applied Mathematics - Special double volume: interconnection networks
Complexity of the forwarding index problem

SIAM Journal on Discrete Mathematics
The forwarding index of directed networks

Discrete Applied Mathematics
Edge-forwarding index of star graphs and other Cayley graphs

Discrete Applied Mathematics
Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problem

Discrete Applied Mathematics - Special issue on international workshop of graph-theoretic concepts in computer science WG'98 conference selected papers
Properties and Performance of Folded Hypercubes

IEEE Transactions on Parallel and Distributed Systems

The forwarding indices of augmented cubes

Information Processing Letters
On reliability of the folded hypercubes

Information Sciences: an International Journal
On conditional diagnosability of the folded hypercubes

Information Sciences: an International Journal
Forwarding index of cube-connected cycles

Discrete Applied Mathematics
Some results on topological properties of folded hypercubes

Information Processing Letters
The spanning connectivity of folded hypercubes

Information Sciences: an International Journal

Quantified Score

Hi-index	0.04

Visualization

Abstract

For a given connected graph G of order n, a routing R is a set of n(n - 1) elementary paths specified for every ordered pair of vertices in G. The vertex (resp. edge) forwarding index of a graph is the maximum number of paths of R passing through any vertex (resp. edge) in the graph. In this paper, the authors determine the vertex and the edge forwarding indices of a folded n-cube as (n-1)2n-1 +1-((n+l)/2) (n ⌊n+1/2⌋) and 2n-(n,⌊n+1/2⌋),respectively.