Introducing perfectly nested circuits

• Zenaida Castillo ^[2] ; Nerio Borges ^[1] ; Ramón Pino ^[3] ; María Carrasco
  1. [1] Escuela Politécnica Nacional

     Escuela Politécnica Nacional

     Quito, Ecuador

     
  2. [2] Escuela Superior Politécnica de Chimborazo, Riobamba, Ecuador
  3. [3] Universidad de Los Andes, Mérida, Venezuela

  Mostrar afiliaciones +
• Localización: RISTI: Revista Ibérica de Sistemas e Tecnologias de Informação, ISSN-e 1646-9895, Nº. Extra 32, 2020, págs. 266-278
• Idioma: inglés
• Enlaces
  • Texto Completo Ejemplar
• Resumen

  • Nested graphs have been used in different applications, for example to represent knowledge in semantic networks. On the other hand, graphs with cycles are really important in surface reconstruction, periodic schedule and network analysis. Also, of particular interest are the cycle basis, which arise in mathematical and algorithm problems. In this work we develop the concept of perfectly nested circuits, exploring some of their properties. The main result establishes an order isomorphism between some sets of perfectly nested circuits and equivalence classes over finite binary sequences. This main result could be useful for analizing binary sequences. As a particular case of nested graphs, PCNs could be useful in applications where general nested graphs are used; and this is in the immediate future of this research.