The forwarding indices of augmented cubes

Authors:
Min Xu;Jun-Ming Xu
Affiliations:
Institute of Applied Mathematics, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100080, China;Department of Mathematics, University of Science and Technology of China, Hefei, Anhui 230026, China
Venue:
Information Processing Letters
Year:
2007

Citing 14
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 edge-forwarding index of orbital regular graphs

Discrete Mathematics
The forwarding index of directed networks

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

Discrete Applied Mathematics
Edge Congestion and Topological Properties of Crossed Cubes

IEEE Transactions on Parallel and Distributed Systems
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
Routing in Recursive Circulant Graphs: Edge Forwarding Index and Hamiltonian Decomposition

WG '98 Proceedings of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science
The proof of a conjecture of Bouabdallah and Sotteau

Networks
Forwarding indices of folded n-cubes

Discrete Applied Mathematics
The Forwarding Indices of Random Graphs

Random Structures & Algorithms

Automorphisms of augmented cubes

International Journal of Computer Mathematics
Forwarding index of cube-connected cycles

Discrete Applied Mathematics
Embedding Hamiltonian paths in augmented cubes with a required vertex in a fixed position

Computers & Mathematics with Applications
Edge-fault-tolerant vertex-pancyclicity of augmented cubes

Information Processing Letters
The paths embedding of the arrangement graphs with prescribed vertices in given position

Journal of Combinatorial Optimization
Conditional edge-fault pancyclicity of augmented cubes

Theoretical Computer Science

Quantified Score

Hi-index	0.89

Visualization

Abstract

For a given connected graph G of order n, a routing R in G 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 G is the maximum number of paths in R passing through any vertex (resp. edge) in G. Choudum and Sunitha [S.A. Choudum, V. Sunitha, Augmented cubes, Networks 40 (2002) 71-84] proposed a variant of the hypercube Q"n, called the augmented cube AQ"n and presented a minimal routing algorithm. This paper determines the vertex and the edge forwarding indices of AQ"n as 2^n9+(-1)^n^+^19+n2^n3-2^n+1 and 2^n^-^1, respectively, which shows that the above algorithm is optimal in view of maximizing the network capacity.