Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 87, 2010 - Issue 6
Submit an article Journal homepage
92
Views
1
CrossRef citations to date
0
Altmetric
Section A

On the average distance of the hypercube tree

M. H. Alsuwaiyel Department of Information and Computer Science, King Fahd University of Petroleum and Minerals, Dhahran, Saudi ArabiaCorrespondence[email protected]
Pages 1208-1216 | Received 17 Nov 2006, Accepted 21 Mar 2008, Published online: 14 Oct 2008

References

  • Aboelaze , M. 1996 . MLH: A hierarchical hypercube network . Networks , 28 : 157 – 165 .
  • Banerjee , P. , Rahmeh , J. T. , Stunkel , C. B. , Nair , V. S.S. , Roy , K. and Abraham , J. A. 1988 . An evaluation of system-level fault tolerance on the Intel hypercube multiprocessor . Proc. 18th Int. Symp. Fault-Tolerant Comput. , : 362 – 367 .
  • Dobrynin , A. A. , Entringer , R. and Gutmann , I. 2001 . Wiener index of trees: theory and applications . Acta Appl. Math. , 66 : 211 – 249 .
  • Dankelmann , P. 1993 . Computing the average distance of an interval graph . Inf. Process Lett. , 43 : 311 – 314 .
  • Dong , T. 2005 . A linear time pessimistic one-step diagnosis algorithm for hypercube multicomputer systems . Parallel Comput. , 31 : 933 – 947 .
  • Doyle , J. K. and Graver , J. E. 1977 . Mean distance in a graph . Discrete Math. , 17 : 147 – 154 .
  • Entringer , R. C. , Kleitman , D. J. and Székely . 1996 . A note on spanning tees with minimum average distance . Bull. Inst. Combin. Appl. , 17 : 71 – 78 .
  • Ho , C. T. and Johnson , S. Distributed routing algorithm for broadcasting and personalized communication in hypercubes . Proc. 1986 Int. Conf. Par. Proc. , 640 – 648 .
  • Izadi , B. A. , Ozguner , F. and Acan , A. 1999 . Highly fault-tolerant hypercube multicomputer . Proc. IEE Comput. Digit. Tech. , 146 : 77 – 82 .
  • Johnson , S. and Ho , C. T. 1989 . Optimum broadcasting and personalized communication in hypercubes . IEEE Trans. Comput. , 38 : 1249 – 1268 .
  • Jordan , C. 1869 . Sur les assemblage des lignes . J. Reine Angew. Math. , 70 : 185 – 190 .
  • Johnson , D. S. , Lenstra , J. K. and Kan , A. H.G.R. 1978 . The complexity of the network design problem . Networks , 8 : 279 – 285 .
  • Gutman , I. and Polansky , O. E. 1984 . Mathematical Concepts in Organic Chemistry , Berlin : Springer Verlag .
  • Moon , J. W. 1996 . On the total distance between nodes in trees . Systems Sci. Math. Sci. , 9 : 93 – 96 .
  • Plesnik , J. 1984 . On the sum of all distances in a graph or digraph . J. Graph Theory , 8 : 1 – 21 .
  • Peercy , M. and Banerjee , P. 1992 . Design and analysis of software reconfiguration strategies for hypercube multicomputers under multiple faults . Proc. 22nd Int. Symp. Fault-Tolerant Comput. , : 448 – 455 .
  • Peercy , M. and Banerjee , P. 1995 . Software schemes of reconfiguration and recovery in distributed memory multicomputers using the actor model . Proc. 25th Int. Symp. Fault-Tolerant Comput. , : 479 – 488 .
  • Al-Tawil , K. M. and Avresky , D. R. 1994 . An effective approach for achieving fault tolerance in hypercubes . Fault-Tolerant Parallel Distribut. Syst. , 12–14 : 113 – 120 .
  • Wiener , H. 1947 . Structural determination of paraffin boiling points . J. Am. Chem. Soc. , 69 : 1 – 24 .
  • Wu , B. Y. , Chao , K. M. and Tang , C. Y. 2002 . Light graphs with small routing cost . Networks , 39 : 130 – 138 .
  • Zelinka , B. 1968 . Medians and peripherians of trees . Arch. Math. (Brno) , 4 : 87 – 95 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.