Construções de emparelhamentos de arestas de polígonos regulares
Loading...
Date
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Universidade Federal de Juiz de Fora (UFJF)
DOI
Abstract
This work aims to obtain closed and orientable surfaces by edges-pairing of regular
polygons (17), with the aim of defining pairing graphs and verifying the non-uniqueness
of the identification of polygon edges in the construction of a given surface. We study
the extension and contraction of pairing graphs, defined by Mendes and Romero in (16),
techniques that allow the construction of new edges-pairing graphs or the verification of
whether a given graph is associated with some edges-pairing. In addition, we study pairing
surgery (5), which allows the construction of new pairing graphs, more specifically, families
of trivalent pairing graphs from already known graphs. The inverse process, called pairing
decomposition, allows us to verify whether a given graph can be associated with some
edge pairing of a regular polygon. These techniques, in addition to checking whether a
given graph is an edge-pairing graph, lead to results that guarantee that their application
between edge-pairing graphs results in new edge-pairing graphs of regular polygons.
Description
Citation
Endorsement
Review
Supplemented By
Referenced By
Creative Commons license
Except where otherwise noted, this item's license is described as Acesso Aberto

