Given a class of finite groups, we consider the graph Σ(G) whose vertices are the elements of G and where two vertices g,h G are adjacent if and only if g,h. Moreover, we denote by (G) the set of the isolated vertices of (G) and by (G) the graph obtained from (G) by deleting the isolated vertices. We address the following question: to what extent the fact that (H) is a subgroup of H for any H ≤ G, implies that the graph (G) is connected
Let A be an Abelian group, n?3 be an integer, and ex(n,A) be the maximum integer such that every n-v...
Let G be a 2-generated group. The generating graph Γ (G) of G is the graph whose vertices are the el...
For a finite group G a graph Γ(G) is defined on the elements of G in such a way that two distinct ve...
Given a formation (Formula presented.), we consider the graph whose vertices are the elements of G a...
Given a 2-generated finite group G, the non-generating graph of G has as vertices the elements of G ...
For a finite group G, let Gamma(G) denote the graph defined on the non-identity elements of G in suc...
To any finite group $G$, we may associate a graph whose vertices are the elements of $G$ and where t...
The non-commuting graph Γ(G) of a non-abelian group G is defined as follows. The vertex set V(Γ(G)) ...
Assume that G is a finite group. For every (Formula presented.), we define a graph (Formula presente...
AbstractThe non-commuting graph ΓG of a non-abelian group G is defined as follows. The vertex set of...
We consider the graph whose vertices are the elements of a finitely generated profinite group G and ...
Let G be a non-trivial group. There are many possible ways for associating a graph with G, for the p...
Given a finite group G, denote by \u393. (G) the simple undirected graph whose vertices are the (dis...
For a group G, let Γ(G) denote the graph defined on the elements of G in such a way that two distinc...
Funding: UK ESPRC grant number EP/R014604/1, and partially supported by a grant from the Simons Foun...
Let A be an Abelian group, n?3 be an integer, and ex(n,A) be the maximum integer such that every n-v...
Let G be a 2-generated group. The generating graph Γ (G) of G is the graph whose vertices are the el...
For a finite group G a graph Γ(G) is defined on the elements of G in such a way that two distinct ve...
Given a formation (Formula presented.), we consider the graph whose vertices are the elements of G a...
Given a 2-generated finite group G, the non-generating graph of G has as vertices the elements of G ...
For a finite group G, let Gamma(G) denote the graph defined on the non-identity elements of G in suc...
To any finite group $G$, we may associate a graph whose vertices are the elements of $G$ and where t...
The non-commuting graph Γ(G) of a non-abelian group G is defined as follows. The vertex set V(Γ(G)) ...
Assume that G is a finite group. For every (Formula presented.), we define a graph (Formula presente...
AbstractThe non-commuting graph ΓG of a non-abelian group G is defined as follows. The vertex set of...
We consider the graph whose vertices are the elements of a finitely generated profinite group G and ...
Let G be a non-trivial group. There are many possible ways for associating a graph with G, for the p...
Given a finite group G, denote by \u393. (G) the simple undirected graph whose vertices are the (dis...
For a group G, let Γ(G) denote the graph defined on the elements of G in such a way that two distinc...
Funding: UK ESPRC grant number EP/R014604/1, and partially supported by a grant from the Simons Foun...
Let A be an Abelian group, n?3 be an integer, and ex(n,A) be the maximum integer such that every n-v...
Let G be a 2-generated group. The generating graph Γ (G) of G is the graph whose vertices are the el...
For a finite group G a graph Γ(G) is defined on the elements of G in such a way that two distinct ve...