Graphs encoding the generating properties of a finite group

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.creatorAcciarri, Cristina-
Autor(es): dc.creatorLucchini, Andrea-
Data de aceite: dc.date.accessioned2021-10-14T17:28:55Z-
Data de disponibilização: dc.date.available2021-10-14T17:28:55Z-
Data de envio: dc.date.issued2020-05-26-
Data de envio: dc.date.issued2020-05-26-
Data de envio: dc.date.issued2019-
Fonte completa do material: dc.identifierhttps://repositorio.unb.br/handle/10482/37871-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/capes/608937-
Descrição: dc.descriptionAssume that G is a finite group. For every a, b ∈ N, we define a 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 hx1, . . . , xa, y1, . . . , ybi = G. We study several properties of these graphs (isolated vertices, loops, connectivity, diameter of the connected components) and we investigate the relations between their properties and the group structure, with the aim of understanding which information about G is encoded by these graphs.-
Direitos: dc.rightsAcesso Aberto-
Palavras-chave: dc.subjectGrupos finitos-
Palavras-chave: dc.subjectGráficos-
Título: dc.titleGraphs encoding the generating properties of a finite group-
Tipo de arquivo: dc.typelivro digital-
Aparece nas coleções:Repositório Institucional – UNB

Não existem arquivos associados a este item.