On the commuting probability in finite groups
نویسندگان
چکیده
منابع مشابه
On the Commuting Probability in Finite Groups
Introduction: When G is a finite group, we may endow G×G with the structure of a probability space by assigning the uniform distribution. As was pointed out by W.H. Gustafson [10], the probability that a randomly chosen pair of elements of G commute is then k(G) |G| , where k(G) is the number of conjugacy classes of G. We denote this probability by cp(G). It was also noted in [10] that cp(G) ≤ ...
متن کاملPairwise non-commuting elements in finite metacyclic $2$-groups and some finite $p$-groups
Let $G$ be a finite group. A subset $X$ of $G$ is a set of pairwise non-commuting elements if any two distinct elements of $X$ do not commute. In this paper we determine the maximum size of these subsets in any finite non-abelian metacyclic $2$-group and in any finite non-abelian $p$-group with an abelian maximal subgroup.
متن کاملOn Laplacian energy of non-commuting graphs of finite groups
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..
متن کاملRelative n-th non-commuting graphs of finite groups
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...
متن کاملA Kind of Non-commuting Graph of Finite Groups
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...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2006
ISSN: 0021-8693
DOI: 10.1016/j.jalgebra.2005.09.044