Genus, thickness and crossing number of graphs encoding the generating properties of finite groups

Assume that G is a finite group and let a and b be non-negative integers. We define an undirected graph Γa,b(G) whose vertices correspond to the elements of G a ∪ G b and in which two tuples (x1, . . . , xa) and (y1, . . . , yb) are adjacent if and only if ⟨x1, . . . , xa, y1, . . . , yb⟩ = G. Our...

Full description

Main Authors: Acciarri, Cristina, Lucchini, Andrea
Format: Artigo
Language: Inglês
Published: Elsevier 2022
Subjects:
Online Access: https://repositorio.unb.br/handle/10482/42871
https://doi.org/10.1016/j.disc.2021.112289
Tags: Add Tag
No Tags, Be the first to tag this record!