اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOn Bounding the Diameter of the Commuting Graph of a Group
184
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The commuting graph of a group $G$ is the simple undirected graph whose vertices are the non-central elements of $G$ and two distinct vertices are adjacent if and only if they commute. It is conjectured by Jafarzadeh and Iranmanesh that there is a universal upper bound on the diameter of the commuting graphs of finite groups when the commuting graph is connected. In this paper we determine upper bounds on the diameter of the commuting graph for some classes of groups to rule them out as possible counterexamples to this conjecture. We also give an example of an infinite family of groups with trivial centre and diameter 6, the previously largest known diameter for an infinite family was 5 for $S_n$.
قيم البحث
اقرأ أيضاً
Denote by $m(G)$ the largest size of a minimal generating set of a finite group $G$. We estimate $m(G)$ in terms of $sum_{pin pi(G)}d_p(G),$ where we are denoting by $d_p(G)$ the minimal number of generators of a Sylow $p$-subgroup of $G$ and by $pi(
G)$ the set of prime numbers dividing the order of $G$.
For a group $G$, we define a graph $Delta(G)$ by letting $G^{#} = G setminus { 1 }$ be the set of vertices and by drawing an edge between distinct elements $x,yin G^{#}$ if and only if the subgroup $langle x,yrangle$ is cyclic. Recall that a $Z$-grou
p is a group where every Sylow subgroup is cyclic. In this short note, we investigate $Delta(G)$ for a $Z$-group $G$.
The commuting graph of a group G, denoted by Gamma(G), is the simple undirected graph whose vertices are the non-central elements of G and two distinct vertices are adjacent if and only if they commute. Let Z_m be the commutative ring of equivalence
classes of integers modulo m. In this paper we investigate the connectivity and diameters of the commuting graphs of GL(n,Z_m) to contribute to the conjecture that there is a universal upper bound on diam(Gamma(G)) for any finite group G when Gamma(G) is connected. For any composite m, it is shown that Gamma(GL(n,Z_m)) and Gamma(M(n,Z_m)) are connected and diam(Gamma(GL(n,Z_m))) = diam(Gamma(M(n,Z_m))) = 3. For m a prime, the instances of connectedness and absolute bounds on the diameters of Gamma(GL(n,Z_m)) and Gamma(M(n,Z_m)) when they are connected are concluded from previous results.
We count the finitely generated subgroups of the modular group $textsf{PSL}(2,mathbb{Z})$. More precisely: each such subgroup $H$ can be represented by its Stallings graph $Gamma(H)$, we consider the number of vertices of $Gamma(H)$ to be the size of
$H$ and we count the subgroups of size $n$. Since an index $n$ subgroup has size $n$, our results generalize the known results on the enumeration of the finite index subgroups of $textsf{PSL}(2,mathbb{Z})$. We give asymptotic equivalents for the number of finitely generated subgroups of $textsf{PSL}(2,mathbb{Z})$, as well as of the number of finite index subgroups, free subgroups and free finite index subgroups. We also give the expected value of the isomorphism type of a size $n$ subgroup and prove a large deviations statement concerning this value. Similar results are proved for finite index and for free subgroups. Finally, we show how to efficiently generate uniformly at random a size $n$ subgroup (resp. finite index subgroup, free subgroup) of $textsf{PSL}(2,mathbb{Z})$.
For a finite group $G$ with a normal subgroup $H$, the enhanced quotient graph of $G/H$, denoted by $mathcal{G}_{H}(G),$ is the graph with vertex set $V=(Gbackslash H)cup {e}$ and two vertices $x$ and $y$ are edge connected if $xH = yH$ or $xH,yHin l
angle zHrangle$ for some $zin G$. In this article, we characterize the enhanced quotient graph of $G/H$. The graph $mathcal{G}_{H}(G)$ is complete if and only if $G/H$ is cyclic, and $mathcal{G}_{H}(G)$ is Eulerian if and only if $|G/H|$ is odd. We show some relation between the graph $mathcal{G}_{H}(G)$ and the enhanced power graph $mathcal{G}(G/H)$ that was introduced by Sudip Bera and A.K. Bhuniya (2016). The graph $mathcal{G}_H(G)$ is complete if and only if $G/H$ is cyclic if and only if $mathcal{G}(G/H)$ is complete. The graph $mathcal{G}_H(G)$ is Eulerian if and only if $|G|$ is odd if and only if $mathcal{G}(G)$ is Eulerian, i.e., the property of being Eulerian does not depend on the normal subgroup $H$.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
