اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدThe number of spanning trees of power graphs associated with specific groups and some applications
56
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Given a group $G$, we define the power graph $mathcal{P}(G)$ as follows: the vertices are the elements of $G$ and two vertices $x$ and $y$ are joined by an edge if $langle xranglesubseteq langle yrangle$ or $langle yranglesubseteq langle xrangle$. Obviously the power graph of any group is always connected, because the identity element of the group is adjacent to all other vertices. In the present paper, among other results, we will find the number of spanning trees of the power graph associated with specific finite groups. We also determine, up to isomorphism, the structure of a finite group $G$ whose power graph has exactly $n$ spanning trees, for $n<5^3$. Finally, we show that the alternating group $mathbb{A}_5$ is uniquely determined by tree-number of its power graph among all finite simple groups.
قيم البحث
اقرأ أيضاً
The power graph $mathcal{P}(G)$ of a finite group $G$ is the graph whose vertex set is $G$, and two elements in $G$ are adjacent if one of them is a power of the other. The purpose of this paper is twofold. First, we find the complexity of a clique--
replaced graph and study some applications. Second, we derive some explicit formulas concerning the complexity $kappa(mathcal{P}(G))$ for various groups $G$ such as the cyclic group of order $n$, the simple groups $L_2(q)$, the extra--special $p$--groups of order $p^3$, the Frobenius groups, etc.
In this paper we have investigated some properties of the power graph and commuting graph associated with a finite group, using their tree-numbers. Among other things, it has been shown that the simple group $L_2(7)$ can be characterized through the
tree-number of its power graph. Moreover, the classification of groups with power-free decomposition is presented. Finally, we have obtained an explicit formula concerning the tree-number of commuting graphs associated with the Suzuki simple groups.
Let $G$ be a finite group and let $pi(G)={p_1, p_2, ldots, p_k}$ be the set of prime divisors of $|G|$ for which $p_1<p_2<cdots<p_k$. The Gruenberg-Kegel graph of $G$, denoted ${rm GK}(G)$, is defined as follows: its vertex set is $pi(G)$ and two dif
ferent vertices $p_i$ and $p_j$ are adjacent by an edge if and only if $G$ contains an element of order $p_ip_j$. The degree of a vertex $p_i$ in ${rm GK}(G)$ is denoted by $d_G(p_i)$ and the $k$-tuple $D(G)=left(d_G(p_1), d_G(p_2), ldots, d_G(p_k)right)$ is said to be the degree pattern of $G$. Moreover, if $omega subseteq pi(G)$ is the vertex set of a connected component of ${rm GK}(G)$, then the largest $omega$-number which divides $|G|$, is said to be an order component of ${rm GK}(G)$. We will say that the problem of OD-characterization is solved for a finite group if we find the number of pairwise non-isomorphic finite groups with the same order and degree pattern as the group under study. The purpose of this article is twofold. First, we completely solve the problem of OD-characterization for every finite non-abelian simple group with orders having prime divisors at most 29. In particular, we show that there are exactly two non-isomorphic finite groups with the same order and degree pattern as $U_4(2)$. Second, we prove that there are exactly two non-isomorphic finite groups with the same order components as $U_5(2)$.
The primary purpose of this paper is to report on the successful enumeration in Magma of representatives of the $195,826,352$ conjugacy classes of transitive subgroups of the symmetric group $S_{48}$ of degree 48. In addition, we have determined that
25707 of these groups are minimal transitive and that 713 of them are elusive. The minimal transitive examples have been used to enumerate the vertex-transitive graphs of degree $48$, of which there are $1,538,868,366$, all but $0.1625%$ of which arise as Cayley graphs. We have also found that the largest number of elements required to generate any of these groups is 10, and we have used this fact to improve previous general bounds of the third author on the number of elements required to generate an arbitrary transitive permutation group of a given degree. The details of the proof of this improved bound will be published by the third author as a separate paper
In this paper we study prime graphs of finite groups. The prime graph of a finite group $G$, also known as the Gruenberg-Kegel graph, is the graph with vertex set {primes dividing $|G|$} and an edge $p$-$q$ if and only if there exists an element of o
rder $pq$ in $G$. In finite group theory, studying the prime graph of a group has been an important topic for the past almost half century. Only recently prime graphs of solvable groups have been characterized in graph theoretical terms only. In this paper, we continue this line of research and give complete characterizations of several classes of groups, including groups of square-free order, metanilpotent groups, groups of cube-free order, and, for any $nin mathbb{N}$, solvable groups of $n^text{th}$-power-free order. We also explore the prime graphs of groups whose composition factors are cyclic or $A_5$ and draw connections to a conjecture of Maslova. We then propose an algorithm that recovers the prime graph from a dual prime graph.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
