For a finite group G let Gamma(G) denote the graph defined on the non-identity elements of G in such a way that two distinct vertices are connected by an edge if and only if they generate G. In this paper it is shown that the graph Gamma(G) contains a Hamiltonian cycle for many finite groups G.

Hamiltonian cycles in the generating graphs of finite groups

LUCCHINI, ANDREA;
2010

Abstract

For a finite group G let Gamma(G) denote the graph defined on the non-identity elements of G in such a way that two distinct vertices are connected by an edge if and only if they generate G. In this paper it is shown that the graph Gamma(G) contains a Hamiltonian cycle for many finite groups G.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11577/2425067
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 25
  • ???jsp.display-item.citation.isi??? 23
  • OpenAlex ND
social impact