ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Discrete Applied Mathematics
Volume 136, Issue 1, 30 January 2004, Pages 63-82
Discrete Mathematics and Theoretical Computer Science (DMTCS)
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (299 K)

  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/S0166-218X(03)00199-9    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2003 Elsevier B.V. All rights reserved.

Expanding and forwarding parameters of product graphs*1

Jianguo QianCorresponding Author Contact Information, E-mail The Corresponding Author and Fuji Zhang

Department of Mathematics, Xiamen University, Xiamen, Fujian 361005, PR China

Received 15 July 2000; 
revised 28 May 2001; 
accepted 19 December 2001. ;
Available online 23 August 2003.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

Expanding 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 convergent (refers to the limit t→∞), which reveals some further properties concerning the forwarding parameters of the product graphs.

Author Keywords: Routing; Expanding factor; Forwarding index; Product graph

Mathematical subject codes: 05C90

Article Outline

1. Introduction and definitions
2. Expanding factors
3. Forwarding indices
3.1. Upper bounds and lower bounds
3.2. t-forwarding indices
4. Applications
5. Final remark
References

Discrete Applied Mathematics
Volume 136, Issue 1, 30 January 2004, Pages 63-82
Discrete Mathematics and Theoretical Computer Science (DMTCS)
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.