For a finite group G a graph Gamma(G) is defined on the elements of G in such a way that two distinct vertices are connected by an edge if and only if they generate G.Some results and questions are given about Gamma(G). This article is much focused on the relationship between two invariants associated to the graph Gamma(G): the clique number and the chromatic number.
Some results and questions related to the generating graph a finite group
LUCCHINI, ANDREA;
2009
Abstract
For a finite group G a graph Gamma(G) is defined on the elements of G in such a way that two distinct vertices are connected by an edge if and only if they generate G.Some results and questions are given about Gamma(G). This article is much focused on the relationship between two invariants associated to the graph Gamma(G): the clique number and the chromatic number.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.
