Skip to main content
Top

2019 | OriginalPaper | Chapter

On Transforming Unit Cube into Tree by One-Point Mutation

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

This work is presenting new properties of vertices of a dimensional unit cube obtained after mutually unambiguous (bijective) transformation of these vertices of a cube into a tree. Some of the presented properties were obtained with the Newton symbol based on an extended definition.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference Abraham, J., Arockiaraj, M.: Wirelength of enhanced hypercubes into r-Rooted complete binary trees. Electron. Notes Discret. Math. 53, 373–382 (2016)MathSciNetCrossRef Abraham, J., Arockiaraj, M.: Wirelength of enhanced hypercubes into r-Rooted complete binary trees. Electron. Notes Discret. Math. 53, 373–382 (2016)MathSciNetCrossRef
2.
go back to reference Ammerlaan, J., Vassilev, T.S.: Properties of the binary hypercube and middle level graphs. Appl. Math. 3(1), 20–26 (2013) Ammerlaan, J., Vassilev, T.S.: Properties of the binary hypercube and middle level graphs. Appl. Math. 3(1), 20–26 (2013)
3.
go back to reference Bhatt, S.N., Chung, F.R., Leighton, F.T., Rosenberg, A.L.: Efficient embeddings of trees in hypercubes. SIAM J. Comput. 21(1), 151–162 (1992)MathSciNetCrossRef Bhatt, S.N., Chung, F.R., Leighton, F.T., Rosenberg, A.L.: Efficient embeddings of trees in hypercubes. SIAM J. Comput. 21(1), 151–162 (1992)MathSciNetCrossRef
4.
go back to reference Bookstein, A., Kulyukin, V.A., Raita, T.: Generalized hamming distance. Inf. Retr. 5(4), 353–375 (2002)CrossRef Bookstein, A., Kulyukin, V.A., Raita, T.: Generalized hamming distance. Inf. Retr. 5(4), 353–375 (2002)CrossRef
5.
go back to reference Graham, R.L., Hell, P.: On the history of the minimum spanning tree problem. Ann. Hist. Comput. 7(1), 43–57 (1985)MathSciNetCrossRef Graham, R.L., Hell, P.: On the history of the minimum spanning tree problem. Ann. Hist. Comput. 7(1), 43–57 (1985)MathSciNetCrossRef
6.
go back to reference Hwang, K., Jotwani, N.: Advanced Computer Architecture, 3rd edn. McGraw-Hill Education, New York (2011) Hwang, K., Jotwani, N.: Advanced Computer Architecture, 3rd edn. McGraw-Hill Education, New York (2011)
8.
go back to reference Leighton, F.T.: Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Elsevier, Amsterdam (2014)MATH Leighton, F.T.: Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Elsevier, Amsterdam (2014)MATH
9.
go back to reference Liu, Z., Fan, J., Jia, X.: Embedding complete binary trees into parity cubes. J. Supercomput. 71(1), 1–27 (2015)CrossRef Liu, Z., Fan, J., Jia, X.: Embedding complete binary trees into parity cubes. J. Supercomput. 71(1), 1–27 (2015)CrossRef
10.
go back to reference Nielsen, F.: Topology of interconnection networks. In: Introduction to HPC with MPI for Data Science, pp. 63–97. Springer, Cham (2016) Nielsen, F.: Topology of interconnection networks. In: Introduction to HPC with MPI for Data Science, pp. 63–97. Springer, Cham (2016)
11.
go back to reference Mulder, H.M.: What do trees and hypercubes have in common? In: Graph Theory, pp. 149–170. Springer, Cham (2016) Mulder, H.M.: What do trees and hypercubes have in common? In: Graph Theory, pp. 149–170. Springer, Cham (2016)
12.
go back to reference Pliszka, Z., Unold, O.: On the ability of the one-point crossover operator to search the space in genetic algorithms. In: Rutkowski, L., et al. (eds.) ICAISC 2015, Part I. LNAI, vol. 9119, pp. 361–369. Springer, Cham (2015) Pliszka, Z., Unold, O.: On the ability of the one-point crossover operator to search the space in genetic algorithms. In: Rutkowski, L., et al. (eds.) ICAISC 2015, Part I. LNAI, vol. 9119, pp. 361–369. Springer, Cham (2015)
13.
go back to reference Saad, Y., Schultz, M.H.: Topological properties of hypercubes. IEEE Trans. Comput. 37(7), 867–872 (1988)CrossRef Saad, Y., Schultz, M.H.: Topological properties of hypercubes. IEEE Trans. Comput. 37(7), 867–872 (1988)CrossRef
14.
go back to reference Sahba, A., Prevost, J.J.: Hypercube based clusters in cloud computing. In: World Automation Congress (WAC), pp. 1–6. IEEE (2016) Sahba, A., Prevost, J.J.: Hypercube based clusters in cloud computing. In: World Automation Congress (WAC), pp. 1–6. IEEE (2016)
15.
Metadata
Title
On Transforming Unit Cube into Tree by One-Point Mutation
Authors
Zbigniew Pliszka
Olgierd Unold
Copyright Year
2019
DOI
https://doi.org/10.1007/978-3-319-99996-8_7

Premium Partner