APPLICATIONS OF HYPERCUBE GEOMETRY IN GRAPH THEORY USING PYTHON
Abstract
This article discusses hypercube geometry and its applications in graph theory and computational problems, highlighting its structural properties and potential use in analysis and modeling contexts. The central objective of the study is to identify computational solutions that utilize the hypercube architecture and hypercube graph in solving different types of problems. It seeks to understand how these structures are employed in different contexts, highlighting their characteristics, advantages, and application possibilities in various areas of computing. The methodological approach is theoretical and deductive, relying on definitions, as well as the use of graphical illustrations and computational simulations to support the understanding of the analyzed structures. For the research, the integrative literature review method was adopted, guided by the PRISMA protocol, with systematic searches in the SciELO, IEEE Xplore, and MyEBSCO databases. In total, 11 articles selected from the searches were analyzed, in addition to 8 works previously included due to their theoretical relevance to the topic, totaling 19 studies examined. As a complementary result of the review, a Python library was developed containing implementations and transcripts of computational applications identified in the literature, with the aim of supporting the practical exploration of the solutions found.
Author Biographies
Doutorando no Programa de Pós-Graduação em Engenharia e Gestão do Conhecimento - PPGEGC – Universidade Federal de Santa Catarina (UFSC) Florianópolis, Santa Catarina – Brasil.
É licenciada em Matemática, com mestrado e doutorado em Engenharia de Produção pela UFSC. Foi professora visitante da Universidade Federal do Paraná no Programa de Pós-Graduação em Design (2012 - 2014). Foi pesquisadora da Université Paris 1 (Panthéon-Sorbonne). É professora titular voluntária e professora permanente do Programa de Pós-Graduação em Engenharia e Gestão do Conhecimento da UFSC. Especialista em Neurociências 2021, pelo Instituto de Desenvolvimento Educacional (IDE).
References
ALMEIDA, Norton Gomes de. Introdução à Computação e Informação Quântica: Incluindo Álgebra Linear com Kets e Bras. 1° ed. São Paulo: Livraria da Física, 2020.
BALASUBRAMANIAN, Krishnan. Topological indices, graph spectra, entropies, Laplacians, and matching polynomials of n-dimensional hypercubes. Symmetry, v. 15, n. 2, p. 557, 2023.
BECERRA-GAVINO, Gustavo; BARBOSA-SANTILLAN, Liliana Ibeth. The quantum hypercube as a k-mer graph. Frontiers in Bioinformatics, v. 4, p. 1401223, 2024.
DUAN, Yubin; LI, Xiuqi; WU, Jie. Topology design and graph embedding for decentralized federated learning. Intelligent and Converged Networks, v. 5, n. 2, p. 100-115, 2024.
GOMES, Paulo César Rodacki. Grafos: Conceitos Fundamentais, Algoritmos e Aplicações. Blumenau: IFC, 2022.
ICHIDA, Hiroyuki; KANEKO, Keiichi. Set-to-set disjoint paths problem in Möbius cubes. IEEE Access, v. 10, p. 83075-83084, 2022.
JHA, Pranava K. 1-perfect codes over the quad-cube. IEEE Transactions on Information Theory, v. 68, n. 10, p. 6481-6504, 2022.
MISHRA, Kumar Vijay; KRISHNAN, Sunder Ram; SADLER, Brian M. Constellation design with hypercube graphs. IEEE Signal Processing Letters, v. 30, p. 1152–1156, 2023. Disponível em: https://doi.org/10.1109/LSP.2023.3308813 Acesso em: 17 ago. 2025.
NAVIS, V. Vinitha; MARAPPAN, Raja. Graph embedding strategy for efficient routing and optimal wavelength assignment in array-based WDM optical networks with enhanced hypercube topology. Computers and Electrical Engineering, v. 127, p. 110571, 2025.
RAO, Yanyi; ZHANG, Xianda. The characterizations of hyper-star graphs induced by linearly separable Boolean functions. Chinese Journal of Electronics, v. 27, n. 1, p. 19–25, 2018.
RUBEI, Elena; ZIANI, Dario Villanis. A characterization of distance matrices of weighted hypercube graphs and Petersen graphs. Journal of Multiple-Valued Logic & Soft Computing, v. 34, 2020. Disponível em: <research.ebsco.com/c/spunt7/viewer/pdf/vkkwjy37rz>. Acesso em: 3 abr. 2026.
SAGOLS, Feliú; MORALES-LUNA, Guillermo; BUITRON-DAMASO, Israel. Trajectory Graphs Appearing from the Skein Problems at the Hypercube. Computación y Sistemas, v. 20, n. 1, p. 81-87, 2016. https://doi.org/10.13053/cys-20-1-2061 Acesso em 17 ago 2025.
SEO, Jung-hyun; LEE, HyeongOk. Design and analysis of the rotational binary graph as an alternative to hypercube and Torus. The Journal of Supercomputing, v. 76, n. 9, p. 7161-7176, 2020. https://doi.org/10.1007/s11227-019-03115-x Acesso em 17 ago 2025.
SEONG, Bo Ok; JANG, Jin-Hyeok; LEE, Hyeong Ok. Full Binary Tree-Based Fixed Degree Graph Design and Parallel Algorithm. IEEE Access, v. 11, p. 120816-120826, 2023.
SONG, Siang Wun. Sintese de algoritmos paralelos para o n-cubo binario. 1991. Tese de Doutorado. Universidade de São Paulo.
TAKEMOTO, Carla Yayoi. O método de Dobramento Recursivo para Imersão em Hipercubos e suas Aplicações. 1998. Tese de Doutorado. Universidade de São Paulo.
WEST, Douglas Brent et al. Introduction to graph theory. Upper Saddle River: Prentice hall, 1996.
WOLFRAM RESEARCH. Hypercube. Disponível em: https://mathworld.wolfram.com/Hypercube.html Acesso em: 5 out. 2025.
WOLFRAM|ALPHA. Hypercube. Disponível em: https://www.wolframalpha.com/input/?i=hypercube Acesso em: 5 out. 2025.
License
Copyright (c) 2026 RECIMA21 - Revista Científica Multidisciplinar - ISSN 2675-6218
This work is licensed under a Creative Commons Attribution 4.0 International License.
Os direitos autorais dos artigos/resenhas/TCCs publicados pertecem à revista RECIMA21, e seguem o padrão Creative Commons (CC BY 4.0), permitindo a cópia ou reprodução, desde que cite a fonte e respeite os direitos dos autores e contenham menção aos mesmos nos créditos. Toda e qualquer obra publicada na revista, seu conteúdo é de responsabilidade dos autores, cabendo a RECIMA21 apenas ser o veículo de divulgação, seguindo os padrões nacionais e internacionais de publicação.