نتایج جستجو برای: commuting graph
تعداد نتایج: 203969 فیلتر نتایج به سال:
let r be a non-commutative ring with unity. the commuting graph of $r$ denoted by $gamma(r)$, is a graph with a vertex set $rsetminus z(r)$ and two vertices $a$ and $b$ are adjacent if and only if $ab=ba$. in this paper, we investigate non-commutative rings with unity of order $p^n$ where $p$ is prime and $n in lbrace 4,5 rbrace$. it is shown that, $gamma(r)$ is the disjoint ...
The commuting graph ∆(G) of a group G is the graph whose vertex set is the group and two distinct elements x and y being adjacent if and only if xy = yx. In this paper the automorphism group of this graph is investigated. We observe that Aut(∆(G)) is a non-abelian group such that its order is not prime power and square-free.
Suppose n is a fixed positive integer. We introduce the relative n-th non-commuting graph ΓH,G, associated to the nonabelian subgroup H of group G. The vertex set is G \ C H,G in which C H,G = {x ∈ G : [x, y] = 1 and [x, y] = 1 for all y ∈ H}. Moreover, {x, y} is an edge if x or y belong to H and xy 6= yx or xy 6= yx. In fact, the relative n-th commutativity degree, Pn(H,G) the probability that...
Let G be a non-abelian group and let Z(G) be the center of G. Associate a graph ΓG (called noncommuting graph of G) with G as follows: Take G\Z(G) as the vertices of ΓG and join two distinct vertices x and y, whenever xy = yx. We want to explore how the graph theoretical properties of ΓG can effect on the group theoretical properties of G. We conjecture that if G and H are two non-abelian finit...
The commuting graph C(G,X), where G is a group and X is a subset of G, is the graph with vertex set X and distinct vertices being joined by an edge whenever they commute. Here the diameter of C(G,X) is studied when G is a symmetric group and X a conjugacy class of elements of order 3.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید