{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T18:39:12Z","timestamp":1740163152438,"version":"3.37.3"},"reference-count":13,"publisher":"Wiley","license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer Networks and Communications"],"published-print":{"date-parts":[[2014]]},"abstract":"<jats:p>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<mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M1\"><mml:mrow><mml:mi>h<\/mml:mi><\/mml:mrow><\/mml:math>admits two edge-disjoint Fibonacci trees of height<mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M2\"><mml:mrow><mml:mi>h<\/mml:mi><\/mml:mrow><\/mml:math>, two edge-disjoint Fibonacci trees of height<mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M3\"><mml:mi>h<\/mml:mi><mml:mo>-<\/mml:mo><mml:mn fontstyle=\"italic\">2<\/mml:mn><\/mml:math>, two edge-disjoint Fibonacci trees of height<mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M4\"><mml:mi>h<\/mml:mi><mml:mo>-<\/mml:mo><mml:mn fontstyle=\"italic\">4<\/mml:mn><\/mml:math>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.<\/jats:p>","DOI":"10.1155\/2014\/498349","type":"journal-article","created":{"date-parts":[[2014,10,19]],"date-time":"2014-10-19T17:03:35Z","timestamp":1413738215000},"page":"1-4","source":"Crossref","is-referenced-by-count":0,"title":["Edge-Disjoint Fibonacci Trees in Hypercube"],"prefix":"10.1155","volume":"2014","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0981-9165","authenticated-orcid":true,"given":"Indhumathi","family":"Raman","sequence":"first","affiliation":[{"name":"School of Information Technology & Engineering, VIT University, Vellore 632 014, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2358-905X","authenticated-orcid":true,"given":"Lakshmanan","family":"Kuppusamy","sequence":"additional","affiliation":[{"name":"School of Computing Science & Engineering, VIT University, Vellore 632 014, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"year":"1992","key":"2"},{"key":"3","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/978-3-7091-9076-0_13","volume":"7","year":"1990","journal-title":"Computing Supplementary"},{"doi-asserted-by":"publisher","key":"4","DOI":"10.1016\/j.disc.2012.01.033"},{"doi-asserted-by":"publisher","key":"5","DOI":"10.1016\/S0020-0190(99)00033-2"},{"doi-asserted-by":"publisher","key":"6","DOI":"10.1002\/jgt.3190140403"},{"doi-asserted-by":"publisher","key":"7","DOI":"10.1007\/s12190-008-0155-z"},{"doi-asserted-by":"publisher","key":"8","DOI":"10.1155\/2014\/132925"},{"doi-asserted-by":"publisher","key":"9","DOI":"10.1109\/71.205649"},{"doi-asserted-by":"publisher","key":"10","DOI":"10.1016\/j.disc.2004.02.023"},{"doi-asserted-by":"publisher","key":"12","DOI":"10.1109\/71.640012"},{"key":"11","first-page":"465","volume":"103","year":"2012","journal-title":"Ars Combinatoria"},{"doi-asserted-by":"publisher","key":"13","DOI":"10.1016\/j.dam.2013.08.045"},{"doi-asserted-by":"publisher","key":"14","DOI":"10.2298\/FIL1403493Z"}],"container-title":["Journal of Computer Networks and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/jcnc\/2014\/498349.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/jcnc\/2014\/498349.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/jcnc\/2014\/498349.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,22]],"date-time":"2017-06-22T18:41:10Z","timestamp":1498156870000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.hindawi.com\/journals\/jcnc\/2014\/498349\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"references-count":13,"alternative-id":["498349","498349"],"URL":"https:\/\/doi.org\/10.1155\/2014\/498349","relation":{},"ISSN":["2090-7141","2090-715X"],"issn-type":[{"type":"print","value":"2090-7141"},{"type":"electronic","value":"2090-715X"}],"subject":[],"published":{"date-parts":[[2014]]}}}