The θ-commutators of elements of a group with respect to an automorphism are introduced and their properties are investigated. Also, corresponding to θ-commutators, we define the θ-non-commuting graphs of groups and study their correlations with other notions. Furthermore, we study independent sets in θ-non-commuting graphs, which enable us to evaluate the chromatic number of such graphs
There have been many investigations on the combinatorial structures and invariants over the group ac...
A graph consists of points which are called vertices, and connections which are called edges, which ...
Commuting graph is a graph that has a set of points X and two different vertices to be connected dir...
AbstractLet G be any non-abelian group and Z(G) be its center. The non-commuting graph ΓG of G is th...
Abstract. Suppose n is a fixed positive integer. We introduce the relative n-th non-commuting graph ...
AbstractThe non-commuting graph ΓG of a non-abelian group G is defined as follows. The vertex set of...
Let G be a nite group. The power graph P(G) of a group G is the graphwhose vertex set is the group e...
The non-commuting graph $nabla(G)$ of a non-abelian group $G$ is defined as follows: its vertex set ...
An automorphism of finite graph G is a permutation on its vertex set that conserves adjacency. The s...
A dominating set S of a graph is a subset of the vertex set of the graph in which the closed neighbo...
Abstract. The commuting graph of a group G, denoted by Γ(G), is a simple graph whose vertices are al...
This paper concerns aspects of various graphs whose vertex set is a group G and whose edges reflect ...
The commutativity degree, defined as the probability that two randomly selected elements of a group ...
Let G be a metacyclic p-group and Z(G) be its center. The non-commuting graph ΓG of a metacyclic p-g...
Dedicated to Hermann Heineken on the occasion of his 70th birthday Commutators originated over 100 y...
There have been many investigations on the combinatorial structures and invariants over the group ac...
A graph consists of points which are called vertices, and connections which are called edges, which ...
Commuting graph is a graph that has a set of points X and two different vertices to be connected dir...
AbstractLet G be any non-abelian group and Z(G) be its center. The non-commuting graph ΓG of G is th...
Abstract. Suppose n is a fixed positive integer. We introduce the relative n-th non-commuting graph ...
AbstractThe non-commuting graph ΓG of a non-abelian group G is defined as follows. The vertex set of...
Let G be a nite group. The power graph P(G) of a group G is the graphwhose vertex set is the group e...
The non-commuting graph $nabla(G)$ of a non-abelian group $G$ is defined as follows: its vertex set ...
An automorphism of finite graph G is a permutation on its vertex set that conserves adjacency. The s...
A dominating set S of a graph is a subset of the vertex set of the graph in which the closed neighbo...
Abstract. The commuting graph of a group G, denoted by Γ(G), is a simple graph whose vertices are al...
This paper concerns aspects of various graphs whose vertex set is a group G and whose edges reflect ...
The commutativity degree, defined as the probability that two randomly selected elements of a group ...
Let G be a metacyclic p-group and Z(G) be its center. The non-commuting graph ΓG of a metacyclic p-g...
Dedicated to Hermann Heineken on the occasion of his 70th birthday Commutators originated over 100 y...
There have been many investigations on the combinatorial structures and invariants over the group ac...
A graph consists of points which are called vertices, and connections which are called edges, which ...
Commuting graph is a graph that has a set of points X and two different vertices to be connected dir...