We assume to have information about the generating properties of the subsets of a finite group G. In particular, we consider the two following situations. We know, for every subset X of G, whether X is a generating set of G. We know the graph whose vertices are the subsets of G and in which there is an edge connecting X and Y if and only if X∪ Y is a generating set of G. We discuss how this kind of information can be used to discover properties of the group G
For a finite group G, let Gamma(G) denote the graph defined on the non-identity elements of G in suc...
AbstractResults on vertex coloring and the vertex independence number of a finite graph are used to ...
Abstract. For a finite group G let Γ(G) denote the graph defined on the non-identity elements of G i...
Assume that G is a finite group. For every (Formula presented.), we define a graph (Formula presente...
Assume that G is a finite group. For every (Formula presented.), we define a graph (Formula presente...
Assume that G is a finite group. For every (Formula presented.), we define a graph (Formula presente...
For a finite group G a graph Gamma(G) is defined on the elements of G in such a way that two distinc...
For a finite group G a graph Γ(G) is defined on the elements of G in such a way that two distinct ve...
Abstract. The generating graph Γ(H) of a finite group H is the graph defined on the elements of H wi...
The generating graph Λ(H) of a finite group H is the graph defined on the elements of H, with an edg...
Assume that G is a finite group and let a and b be non-negative integers. We define an undirected gr...
Assume that G is a finite group and let a and b be non-negative integers. We define an undirected gr...
For a finite group G let Gamma(G) denote the graph defined on the non-identity elements of G in such...
A central principle of this paper is that, for a finitely presented group G, the al-gebraic properti...
For a finite group G, let Gamma(G) denote the graph defined on the non-identity elements of G in suc...
For a finite group G, let Gamma(G) denote the graph defined on the non-identity elements of G in suc...
AbstractResults on vertex coloring and the vertex independence number of a finite graph are used to ...
Abstract. For a finite group G let Γ(G) denote the graph defined on the non-identity elements of G i...
Assume that G is a finite group. For every (Formula presented.), we define a graph (Formula presente...
Assume that G is a finite group. For every (Formula presented.), we define a graph (Formula presente...
Assume that G is a finite group. For every (Formula presented.), we define a graph (Formula presente...
For a finite group G a graph Gamma(G) is defined on the elements of G in such a way that two distinc...
For a finite group G a graph Γ(G) is defined on the elements of G in such a way that two distinct ve...
Abstract. The generating graph Γ(H) of a finite group H is the graph defined on the elements of H wi...
The generating graph Λ(H) of a finite group H is the graph defined on the elements of H, with an edg...
Assume that G is a finite group and let a and b be non-negative integers. We define an undirected gr...
Assume that G is a finite group and let a and b be non-negative integers. We define an undirected gr...
For a finite group G let Gamma(G) denote the graph defined on the non-identity elements of G in such...
A central principle of this paper is that, for a finitely presented group G, the al-gebraic properti...
For a finite group G, let Gamma(G) denote the graph defined on the non-identity elements of G in suc...
For a finite group G, let Gamma(G) denote the graph defined on the non-identity elements of G in suc...
AbstractResults on vertex coloring and the vertex independence number of a finite graph are used to ...
Abstract. For a finite group G let Γ(G) denote the graph defined on the non-identity elements of G i...