Edge-Disjoint Fibonacci Trees in Hypercube
Joint Authors
Raman, Indhumathi
Kuppusamy, Lakshmanan
Source
Journal of Computer Networks and Communications
Issue
Vol. 2014, Issue 2014 (31 Dec. 2014), pp.1-4, 4 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2014-10-19
Country of Publication
Egypt
No. of Pages
4
Main Subjects
Information Technology and Computer Science
Abstract EN
The Fibonacci tree is a rooted binary tree whose number of vertices admit a recursive definition similar to the Fibonacci numbers.
In this paper, we prove that a hypercube of dimension h admits two edge-disjoint Fibonacci trees of height h, two edge-disjoint Fibonacci trees of height h-2, two edge-disjoint Fibonacci trees of height h-4 and so on, as subgraphs.
The result shows that an algorithm with Fibonacci trees as underlying data structure can be implemented concurrently on a hypercube network with no communication latency.
American Psychological Association (APA)
Raman, Indhumathi& Kuppusamy, Lakshmanan. 2014. Edge-Disjoint Fibonacci Trees in Hypercube. Journal of Computer Networks and Communications،Vol. 2014, no. 2014, pp.1-4.
https://search.emarefa.net/detail/BIM-1040163
Modern Language Association (MLA)
Raman, Indhumathi& Kuppusamy, Lakshmanan. Edge-Disjoint Fibonacci Trees in Hypercube. Journal of Computer Networks and Communications No. 2014 (2014), pp.1-4.
https://search.emarefa.net/detail/BIM-1040163
American Medical Association (AMA)
Raman, Indhumathi& Kuppusamy, Lakshmanan. Edge-Disjoint Fibonacci Trees in Hypercube. Journal of Computer Networks and Communications. 2014. Vol. 2014, no. 2014, pp.1-4.
https://search.emarefa.net/detail/BIM-1040163
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1040163