Table of Contents Author Guidelines Submit a Manuscript
Journal of Computer Networks and Communications
Volume 2014 (2014), Article ID 498349, 4 pages
http://dx.doi.org/10.1155/2014/498349
Research Article

Edge-Disjoint Fibonacci Trees in Hypercube

1School of Information Technology & Engineering, VIT University, Vellore 632 014, India
2School of Computing Science & Engineering, VIT University, Vellore 632 014, India

Received 30 June 2014; Accepted 7 October 2014; Published 19 October 2014

Academic Editor: Liansheng Tan

Copyright © 2014 Indhumathi Raman and Lakshmanan Kuppusamy. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. S. N. Bhatt and I. C. F. Ipsen, “How to embed trees in hypercubes,” Research Report YALEU/DCS/RR-443, Yale University, Department of Computing Science, 1985. View at Google Scholar
  2. F. T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Morgan Kaufmann, San Mateo, Calif, USA, 1992. View at MathSciNet
  3. B. Monien and H. Sudborough, “Embedding one interconnection network in another,” Computing Supplementary, vol. 7, pp. 257–282, 1990. View at Google Scholar
  4. S. Wagner and M. Wild, “Decomposing the hypercube Qn into n isomorphic edge-disjoint trees,” Discrete Mathematics, vol. 312, no. 10, pp. 1819–1822, 2012. View at Publisher · View at Google Scholar · View at Scopus
  5. B. Barden, R. Libeskind-Hadas, J. Davis, and W. Williams, “On edge-disjoint spanning trees in hypercubes,” Information Processing Letters, vol. 70, no. 1, pp. 13–16, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  6. J. F. Fink, “On the decomposition of n-cubes into isomorphic trees,” Journal of Graph Theory, vol. 14, no. 4, pp. 405–411, 1990. View at Publisher · View at Google Scholar · View at MathSciNet
  7. S. A. Choudum and I. Raman, “Embedding height balanced trees and Fibonacci trees in hypercubes,” Journal of Applied Mathematics and Computing, vol. 30, no. 1-2, pp. 39–52, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  8. I. Raman, “A note on closed-form representation of Fibonacci numbers using Fibonacci trees,” ISRN Discrete Mathematics, vol. 2014, Article ID 132925, 3 pages, 2014. View at Publisher · View at Google Scholar
  9. W. J. Hsu, “Fibonacci Cubes. A new interconnection topology,” IEEE Transactions on Parallel and Distributed Systems, vol. 4, no. 1, pp. 3–12, 1993. View at Publisher · View at Google Scholar · View at Scopus
  10. S. Klavžar, “On median nature and enumerative properties of Fibonacci-like cubes,” Discrete Mathematics, vol. 299, no. 1–3, pp. 145–153, 2005. View at Publisher · View at Google Scholar · View at Scopus
  11. J. Wu, “Extended fibonacci cubes,” IEEE Transactions on Parallel and Distributed Systems, vol. 8, no. 12, pp. 1203–1210, 1997. View at Publisher · View at Google Scholar · View at Scopus
  12. R. Sun, Z. Zhu, and L. Tan, “On the Merrifield-Simmons index and Hosoya index of bicyclic graphs with a given girth,” Ars Combinatoria, vol. 103, pp. 465–478, 2012. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  13. Z. Zhu, L. Tan, and Z. Qiu, “Tricyclic graph with maximal Estrada index,” Discrete Applied Mathematics, vol. 162, pp. 364–372, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. Z. Zhu, T. Tao, J. Yu, and L. Tan, “On the Harary index of cacti,” FILOMAT, vol. 28, no. 3, pp. 493–507, 2014. View at Publisher · View at Google Scholar