vix.ing · top · new · best · stats · spec

Truncation symmetry type graphs

2013/06/11 by María del Río Francos, Maria del Rio Francos, Francos, Maria del Rio
Chemistry · Computer Science · Mathematics · #05C10 #51M20 #52B10 #52B15 #57M15 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Synthesis and Properties of Aromatic Compounds #math.CO #msc:05C10 #msc:51M20 #msc:52B10 #msc:52B15 #msc:57M15

paper · pdf · doi:10.48550/arxiv.1306.2540

openalex publication_date 2013/06/11 · arxiv created 2013/10/19 · arxiv updated 2013/10/22 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28

Abstract

There are operations that transform a map M (an embedding of a graph on a surface) into another map in the same surface, modifying its structure and consequently its set of flags F(M). For instance, by truncating all the vertices of a map M, each flag in F(M) is divided into three flags of the truncated map. Orbanic, Pellicer and Weiss studied the truncation of k-orbit maps for k < 4. They introduced the notion of T-compatible maps in order to give a necessary condition for a truncation of a k-orbit map to be either k-, 3k/2- or 3k-orbit map. Using a similar notion, by introducing an appropriate partition on the set of flags of the maps, we extend the results on truncation of k-orbit maps for k < 8 and k=9.

Related