نتایج جستجو برای: n-th non-commuting graph
تعداد نتایج: 2352292 فیلتر نتایج به سال:
suppose $n$ is a fixed positive integer. we introduce the relative n-th non-commuting graph $gamma^{n} _{h,g}$, associated to the non-abelian subgroup $h$ of group $g$. the vertex set is $gsetminus c^n_{h,g}$ in which $c^n_{h,g} = {xin g : [x,y^{n}]=1 mbox{~and~} [x^{n},y]=1mbox{~for~all~} yin h}$. moreover, ${x,y}$ is an edge if $x$ or $y$ belong to $h$ and $xy^{n}eq y^{n}x$ or $x...
Suppose $n$ is a fixed positive integer. We introduce the relative n-th non-commuting graph $Gamma^{n} _{H,G}$, associated to the non-abelian subgroup $H$ of group $G$. The vertex set is $Gsetminus C^n_{H,G}$ in which $C^n_{H,G} = {xin G : [x,y^{n}]=1 mbox{~and~} [x^{n},y]=1mbox{~for~all~} yin H}$. Moreover, ${x,y}$ is an edge if $x$ or $y$ belong to $H$ and $xy^{n}eq y^{n}x$ or $x...
the non commuting graph of a non-abelian finite group $g$ is defined as follows: its vertex set is $g-z(g)$ and two distinct vertices $x$ and $y$ are joined by an edge if and only if the commutator of $x$ and $y$ is not the identity. in this paper we prove some new results about this graph. in particular we will give a new proof of theorem 3.24 of [2]. we also prove that if $g_1$, $g_2$, ..., $...
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 $Gamma(G)$ be the non-commuting graph of $G$. In this paper we define an equivalence relation $sim$ on the set of $V(Gamma(G))=Gsetminus Z(G)$ by taking $xsim y$ if and only if $N(x)=N(y)$, where $ N(x)={uin G | x textrm{ and } u textrm{ are adjacent in }Gamma(G)}$ is the open neighborhood of $x$ in $Gamma(G)$. We introduce a new graph determined ...
Let $G$ be a finite non-abelian group with center $Z(G)$. The non-commuting graph of $G$ is a simple undirected graph whose vertex set is $Gsetminus Z(G)$ and two vertices $x$ and $y$ are adjacent if and only if $xy ne yx$. In this paper, we compute Laplacian energy of the non-commuting graphs of some classes of finite non-abelian groups..
Let $G$ be a non-abelian group. The non-commuting graph $Gamma_G$ of $G$ is defined as the graph whose vertex set is the non-central elements of $G$ and two vertices are joined if and only if they do not commute.In this paper we study some properties of $Gamma_G$ and introduce $n$-regular $AC$-groups. Also we then obtain a formula for Szeged index of $Gamma_G$ in terms of $n$, $|Z(G)|$ and $|G|...
let $g$ be a non-abelian group. the non-commuting graph $gamma_g$ of $g$ is defined as the graph whose vertex set is the non-central elements of $g$ and two vertices are joined if and only if they do not commute.in this paper we study some properties of $gamma_g$ and introduce $n$-regular $ac$-groups. also we then obtain a formula for szeged index of $gamma_g$ in terms of $n$, $|z(g)|$ and $|g|...
let g be a fixed element of a finite group g. we introduce the g-noncommuting graph of g whose vertex set is whole elements of the group g and two vertices x,y are adjacent whenever [x,y] g and [y,x] g. we denote this graph by . in this paper, we present some graph theoretical properties of g-noncommuting graph. specially, we investigate about its planarity and regularity, its clique number a...
Let $R$ be a non-commutative ring with unity. The commuting graph of $R$ denoted by $Gamma(R)$, is a graph with vertex set $RZ(R)$ and two vertices $a$ and $b$ are adjacent iff $ab=ba$. In this paper, we consider the commuting graph of non-commutative rings of order pq and $p^2q$ with Z(R) = 0 and non-commutative rings with unity of order $p^3q$. It is proved that $C_R(a)$ is a commutative ring...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید