Skip to main navigation Skip to search Skip to main content

Hamiltonian property on binary recursive networks

  • Yun Sun*
  • , Zhoujun Li
  • , Deqiang Wang
  • *Corresponding author for this work
  • National University of Defense Technology
  • Dalian Maritime University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

By means of analysis and generalization of the hypercube and its variations of the same topological properties and network parameters, a family of interconnection networks, referred to as binary recursive networks, is introduced in this paper. This kind of networks not only provides a powerful method to investigate the hypercube and its variations on the whole, but also puts forth an effective tool to explore new network structure. A constructive proof is presented to show that binary recursive networks are Hamiltonian based on their recursive structures, and thus a universal searching algorithm for Hamiltonian cycle in binary recursive networks is derived.

Original languageEnglish
Title of host publicationFrontiers in Algorithmics - First Annual International Workshop, FAW 2007, Proceedings
PublisherSpringer Verlag
Pages228-235
Number of pages8
ISBN (Print)9783540738138
DOIs
StatePublished - 2007
Event1st International Frontiers in Algorithmics Workshop, FAW 2007 - Lanzhou, China
Duration: 1 Aug 20073 Aug 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4613 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference1st International Frontiers in Algorithmics Workshop, FAW 2007
Country/TerritoryChina
CityLanzhou
Period1/08/073/08/07

Keywords

  • Binary recursive networks
  • Hamiltonian cycle
  • Hypercube
  • Interconnection network

Fingerprint

Dive into the research topics of 'Hamiltonian property on binary recursive networks'. Together they form a unique fingerprint.

Cite this