相关论文: On the Non-Commuting Graph of Dihedral Group

Let G be a non-abelian group and Z(G) be the center of G. The non-commuting graph {\Gamma}(G) of G is a graph with vertex set is non central elements of G and two vertices x, y are adjacent if and only if they are commute. In this paper we…

A non-commuting graph of a finite group $G$ is a graph whose vertices are non-central elements of $G$ and two vertices are adjacent if they don't commute in $G$. In this paper, we study the non-commuting graph of the group $U_{6n}$ and…

Let $G$ be a non-abelian group and $Z(G)$ be the center of $G$. The non-commuting graph $\Gamma_G$ associated to $G$ is the graph whose vertex set is $G\setminus Z(G)$ and two distinct elements $x,y$ are adjacent if and only if $xy\neq yx$.…

The commuting graph $\Delta(G)$ of a finite non-abelian group $G$ is a simple graph with vertex set $G$ and two distinct vertices $x, y$ are adjacent if $xy = yx$. In this paper, among some properties of $\Delta(G)$, we investigate…

The non--commuting graph $\Gamma(G)$ of a non--abelian group $G$ is defined as follows. The vertex set $V(\Gamma(G))$ of $\Gamma(G)$ is $G\setminus Z(G)$ where $Z(G)$ denotes the center of $G$ and two vertices $x$ and $y$ are adjacent if…

Let $Z(G)$ be the centre of a finite non-abelian group $G.$ The non-commuting graph of $G$ is a simple undirected graph with vertex set $G\setminus Z(G),$ and two vertices $u$ and $v$ are adjacent if and only if $uv\ne vu.$ In this paper,…

For a group $G$ and a subset $X$ of $G$, the commuting graph of $X$, denoted by $\Gamma(G,X)$ is the graph whose vertex set is $X$ and any two vertices $u$ and $v$ in $X$ are adjacent if and only if they commute in $G$. In this article,…

Let $G$ be a finite, non-abelian group of the form $G = A N$, where $A \leq G$ is abelian, and $N \trianglelefteq G$ is cyclic. We prove that the commuting graph $\Gamma(G)$ of $G$ is either a connected graph of diameter at most four, or…

Let $G$ be a non-abelian group and $Z(G)$ be its center. The non-commuting graph $\mathcal{A}_G$ of $G$ is the graph whose vertex set is $G\backslash Z(G)$ and two vertices are joined by an edge if they do not commute. Let…

The non-commuting graph $\Gamma_R$ of a finite ring $R$ with center $Z(R)$ is a simple undirected graph whose vertex set is $R \setminus Z(R)$ and two distinct vertices $a$ and $b$ are adjacent if and only if $ab \ne ba$. In this paper, we…

The commuting graph of a non-abelian group is a simple graph in which the vertices are the non-central elements of the group, and two distinct vertices are adjacent if and only if they commute. In this paper, we classify (up to isomorphism)…

Let $G$ be a finite group. For a fixed element $g$ in $G$ and a given subgroup $H$ of $G$, the relative $g$-noncommuting graph of $G$ is a simple undirected graph whose vertex set is $G$ and two vertices $x$ and $y$ are adjacent if $x \in…

Given a finite group $G$ and a subset $X$ of $G$, the commuting graph of $G$ on $X$, denoted by ${\cal C}(G,X)$, is the graph that has $X$ as its vertex set with $x,y\in X$ joined by an edge whenever $x\neq y$ and $xy=yx$. Let $T$ be a…

Let $G$ be a non-abelian group. The non-commuting graph $\mathcal{A}_G$ of $G$ is defined as the graph whose vertex set is the non-central elements of $G$ and two vertices are joint if and only if they do not commute. In a finite simple…

Let G be a non-abelian group and let Z(G) be the center of G. Associate a graph {\Gamma}G (called non-commuting graph of G) as follows: Take G\Z(G) as the vertices of {\Gamma}G and join x and y, whenever $xy \not= yx$. In this paper, we…

Let $L$ be a finite-dimensional non-abelian Lie algebra with the center $Z(L)$. In this paper, we define a non-commuting graph associated with $L$ as the graph whose vertex set is the projective space of the quotient algebra $L/Z(L)$, and…

Let $G$ be a finite group. The intersection graph of $G$ is a graph whose vertex set is the set of all proper non-trivial subgroups of $G$ and two distinct vertices $H$ and $K$ are adjacent if and only if $H\cap K \neq \{e\}$, where $e$ is…

Let $G$ be a finite non abelian group. The centralizer graph of $G$ is a simple undirected graph $\Gamma_{cent}(G)$, whose vertex set consists of proper centralizers of $G$ and two vertices are adjacent if and only if their cardinalities…

The power graph of a group $G$ is a graph with vertex set $G$, in which two vertices are adjacent if one is some power of the other. In the commuting graph, with $G$ as the vertex set, two vertices are joined by an edge if they commute in…

Let $G$ be a finite non-cyclic group. The non-cyclic graph $\Gamma_G$ of $G$ is the graph whose vertex set is $G\setminus Cyc(G)$, two distinct vertices being adjacent if they do not generate a cyclic subgroup, where $Cyc(G)=\{a\in G:…