Research ArticleOpen accessEvery word in the titleOn Embeddings of Hamiltonian Paths and Cycles in Extended Fibonacci CubesIoana Zelina, Grigor Moldovan, Ioana TascuThe interconnection network is an essential component of a distributed system or of a supercomputer based on large-sale parallel processing. Because in distributed systems the communication between processors is based on message exchange, the network topology is of a great importance. The interconnection network can be seen as a graph and the properties of a network can be studied using … …American Journal of Applied Sciences, Vol. 5, Issue 11 · 30 Nov 2008 · 7,281 accessesView PDFCite
Research ArticleOpen accessIn the keywordsCombinatorial Properties of Modified Chordal Rings Degree Four NetworksR. N. Farah, M. Othman, M. H. SelamatProblem statement: Modified Chordal Rings Degree Four, called CHRm4 is the first modified structure of chordal rings. This CHRm4 is an undirected circulant graph and is a double loop graph. Approach: This study presented the main properties of CHRm4. There are connectivity, Hamiltonian cycle and asymmetric. Results: Several definitions, postulates, corollary, theorems and lemmas were constructed according to these three … …Journal of Computer Science, Vol. 6, Issue 3 · 31 Mar 2010 · 7,467 accessesView PDFCite
Research ArticleOpen accessIn the abstractSolving the Traveling Salesman Problem Using New Operators in Genetic AlgorithmsNaef Taher Al Rahedi, Jalal AtoumProblem statement: Genetic Algorithms (GAs) have been used as search algorithms to find near-optimal solutions for many NP problems. GAs require effective chromosome representations as well as carefully designed crossover and mutation operators to achieve an efficient search. The Traveling Salesman Problem (TSP), as an NP search problem, involves finding the shortest Hamiltonian Path or Cycle in a graph of … …American Journal of Applied Sciences, Vol. 6, Issue 8 · 31 Aug 2009 · 7,584 accessesView PDFCite