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

Acciarri, Cristina; Lucchini, Andrea

Affichage complet

Élément Dublin Core	Valeur	Langue
dc.contributor.author	Acciarri, Cristina	-
dc.contributor.author	Lucchini, Andrea	-
dc.date.accessioned	2022-02-12T14:31:07Z	-
dc.date.available	2022-02-12T14:31:07Z	-
dc.date.issued	2021-04	-
dc.identifier.citation	ACCIARRI, Cristina; LUCCHINI, Andrea. Genus, thickness and crossing number of graphs encoding the generating properties of finite groups. Discrete Mathematics, v. 344, n. 4, 112289, abr. 2021. DOI: https://doi.org/10.1016/j.disc.2021.112289. Disponível em: https://www.sciencedirect.com/science/article/abs/pii/S0012365X21000029. Acesso em: 12 fev. 2022.	pt_BR
dc.identifier.uri	https://repositorio.unb.br/handle/10482/42871	-
dc.language.iso	Inglês	pt_BR
dc.publisher	Elsevier	pt_BR
dc.rights	Acesso Restrito	pt_BR
dc.title	Genus, thickness and crossing number of graphs encoding the generating properties of finite groups	pt_BR
dc.type	Artigo	pt_BR
dc.subject.keyword	Gráficos	pt_BR
dc.subject.keyword	Grupos finitos	pt_BR
dc.rights.license	© 2021 Elsevier B.V. All rights reserved.	pt_BR
dc.identifier.doi	https://doi.org/10.1016/j.disc.2021.112289	pt_BR
dc.relation.publisherversion	https://www.sciencedirect.com/science/article/abs/pii/S0012365X21000029	pt_BR
dc.description.abstract1	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 aim is to estimate the genus, the thickness and the crossing number of the graph Γa,b(G) when a and b are positive integers, giving explicit lower bounds on these invariants in terms of \|G\|.	pt_BR
Collection(s) :	Artigos publicados em periódicos e afins