scholarly journals A SURVEY ON THE AUTOMORPHISM GROUPS OF THE COMMUTING GRAPHS AND POWER GRAPHS

2019 ◽  
pp. 729
Author(s):  
Mahsa Mirzargar
Keyword(s):  
Automorphism Group ◽  
Automorphism Groups ◽  
The Other ◽  
Power Graph ◽  
Commuting Graph ◽  
Vertex Set ◽  
Delta G ◽  
Nite Group

Let G be a nite group. The power graph P(G) of a group G is the graphwhose vertex set is the group elements and two elements are adjacent if one is a power of the other. The commuting graph \Delta(G) of a group G, is the graph whose vertices are the group elements, two of them joined if they commute. When the vertex set is G-Z(G), this graph is denoted by \Gamma(G). Since the results based on the automorphism group of these kinds of graphs are so sporadic, in this paper, we give a survey of all results on the automorphism group of power graphs and commuting graphs obtained in the literature.

scholarly journals On connectedness of power graphs of finite groups

2018 ◽  
Vol 17 (10) ◽  
pp. 1850184 ◽  
Author(s):  
Ramesh Prasad Panda ◽  
K. V. Krishna
Keyword(s):  
Finite Groups ◽  
Upper Bound ◽  
The Other ◽  
Number Of Components ◽  
Cyclic Groups ◽  
Power Graph ◽  
Vertex Set ◽  
Proper Power

The power graph of a group [Formula: see text] is the graph whose vertex set is [Formula: see text] and two distinct vertices are adjacent if one is a power of the other. This paper investigates the minimal separating sets of power graphs of finite groups. For power graphs of finite cyclic groups, certain minimal separating sets are obtained. Consequently, a sharp upper bound for their connectivity is supplied. Further, the components of proper power graphs of [Formula: see text]-groups are studied. In particular, the number of components of that of abelian [Formula: see text]-groups are determined.

scholarly journals On the power graph of a finite group

Filomat ◽  
2012 ◽  
Vol 26 (6) ◽  
pp. 1201-1208 ◽  
Author(s):  
M. Mirzargar ◽  
A.R. Ashrafi ◽  
M.J. Nadjafi-Arani
Keyword(s):  
Finite Group ◽  
The Other ◽  
Power Graph ◽  
Vertex Set ◽  
A Finite Group

The power graph P(G) of a group G is the graph whose vertex set is the group elements and two elements are adjacent if one is a power of the other. In this paper, we consider some graph theoretical properties of a power graph P(G) that can be related to its group theoretical properties. As consequences of our results, simple proofs for some earlier results are presented.

Proper connection of power graphs of finite groups

2020 ◽  
pp. 2150033
Author(s):  
Xuanlong Ma
Keyword(s):  
Finite Group ◽  
Finite Groups ◽  
Undirected Graph ◽  
The Other ◽  
Connection Number ◽  
Power Graph ◽  
Vertex Set ◽  
Proper Connection Number ◽  
A Finite Group

Let [Formula: see text] be a finite group. The power graph of [Formula: see text] is the undirected graph whose vertex set is [Formula: see text], and two distinct vertices are adjacent if one is a power of the other. The reduced power graph of [Formula: see text] is the subgraph of the power graph of [Formula: see text] obtained by deleting all edges [Formula: see text] with [Formula: see text], where [Formula: see text] and [Formula: see text] are two distinct elements of [Formula: see text]. In this paper, we determine the proper connection number of the reduced power graph of [Formula: see text]. As an application, we also determine the proper connection number of the power graph of [Formula: see text].

scholarly journals On the minimum degree of the power graph of a finite cyclic group

2020 ◽  
pp. 2150044
Author(s):  
Ramesh Prasad Panda ◽  
Kamal Lochan Patra ◽  
Binod Kumar Sahoo
Keyword(s):  
Finite Group ◽  
Cyclic Group ◽  
Finite Groups ◽  
Minimum Degree ◽  
Simple Graph ◽  
The Other ◽  
Prime Divisors ◽  
Power Graph ◽  
Vertex Set ◽  
A Finite Group

The power graph [Formula: see text] of a finite group [Formula: see text] is the undirected simple graph whose vertex set is [Formula: see text], in which two distinct vertices are adjacent if one of them is an integral power of the other. For an integer [Formula: see text], let [Formula: see text] denote the cyclic group of order [Formula: see text] and let [Formula: see text] be the number of distinct prime divisors of [Formula: see text]. The minimum degree [Formula: see text] of [Formula: see text] is known for [Formula: see text], see [R. P. Panda and K. V. Krishna, On the minimum degree, edge-connectivity and connectivity of power graphs of finite groups, Comm. Algebra 46(7) (2018) 3182–3197]. For [Formula: see text], under certain conditions involving the prime divisors of [Formula: see text], we identify at most [Formula: see text] vertices such that [Formula: see text] is equal to the degree of at least one of these vertices. If [Formula: see text], or that [Formula: see text] is a product of distinct primes, we are able to identify two such vertices without any condition on the prime divisors of [Formula: see text].

scholarly journals On the characteristic polynomial of power graphs

Filomat ◽  
2018 ◽  
Vol 32 (12) ◽  
pp. 4375-4387
Author(s):  
Modjtaba Ghorbani ◽  
Fatemeh Abbasi-Barfaraz
Keyword(s):  
Finite Group ◽  
Characteristic Polynomial ◽  
The Other ◽  
Power Graph ◽  
Graphs Of Groups ◽  
Vertex Set

The power graph P(G) of finite group G is a graph whose vertex set is G and two distinct vertices are adjacent if one is a power of the other. In this paper, we determine the characteristic polynomial of the power graphs of groups of order a product of three primes.

The automorphism groups of foliations with transverse linear connection

2013 ◽  
Vol 11 (12) ◽  
Author(s):  
Nina Zhukova ◽  
Anna Dolgonosova
Keyword(s):  
Automorphism Group ◽  
Lie Group ◽  
Automorphism Groups ◽  
Linear Connection ◽  
The Other ◽  
Riemannian Foliations ◽  
Infinite Dimensional ◽  
Infinite Dimensional Lie Group

AbstractThe category of foliations is considered. In this category morphisms are differentiable maps sending leaves of one foliation into leaves of the other foliation. We prove that the automorphism group of a foliation with transverse linear connection is an infinite-dimensional Lie group modeled on LF-spaces. This result extends the corresponding result of Macias-Virgós and Sanmartín Carbón for Riemannian foliations. In particular, our result is valid for Lorentzian and pseudo-Riemannian foliations.

scholarly journals Spectrum and L-spectrum of the power graph and its main supergraph for certain finite groups

Filomat ◽  
2017 ◽  
Vol 31 (16) ◽  
pp. 5323-5334 ◽  
Author(s):  
Asma Hamzeh ◽  
Ali Ashrafi
Keyword(s):  
Finite Group ◽  
Characteristic Polynomial ◽  
Finite Groups ◽  
The Other ◽  
Laplacian Spectrum ◽  
Simple Graphs ◽  
Power Graph ◽  
Vertex Set ◽  
A Finite Group

Let G be a finite group. The power graph P(G) and its main supergraph S(G) are two simple graphs with the same vertex set G. Two elements x,y ? G are adjacent in the power graph if and only if one is a power of the other. They are joined in S(G) if and only if o(x)|o(y) or o(y)|o(x). The aim of this paper is to compute the characteristic polynomial of these graph for certain finite groups. As a consequence, the spectrum and Laplacian spectrum of these graphs for dihedral, semi-dihedral, cyclic and dicyclic groups were computed.

On quasiprimitive edge-transitive graphs of odd order and twice prime valency

2020 ◽  
Vol 23 (6) ◽  
pp. 1017-1037
Author(s):  
Hong Ci Liao ◽  
Jing Jian Li ◽  
Zai Ping Lu
Keyword(s):  
Automorphism Group ◽  
Connected Graph ◽  
Automorphism Groups ◽  
Primitive Group ◽  
Odd Order ◽  
Vertex Set ◽  
Edge Transitive ◽  
Affine Type ◽  
Transitive Graphs

AbstractA graph is edge-transitive if its automorphism group acts transitively on the edge set. In this paper, we investigate the automorphism groups of edge-transitive graphs of odd order and twice prime valency. Let {\varGamma} be a connected graph of odd order and twice prime valency, and let G be a subgroup of the automorphism group of {\varGamma}. In the case where G acts transitively on the edge set and quasiprimitively on the vertex set of {\varGamma}, we prove that either G is almost simple, or G is a primitive group of affine type. If further G is an almost simple primitive group, then, with two exceptions, the socle of G acts transitively on the edge set of {\varGamma}.

scholarly journals On the Automorphism Group of Integral Circulant Graphs

10.37236/555 ◽  
2011 ◽  
Vol 18 (1) ◽  
Author(s):  
Milan Bašić ◽  
Aleksandar Ilić
Keyword(s):  
Automorphism Group ◽  
Automorphism Groups ◽  
Quantum Spin ◽  
Perfect State ◽  
Circulant Graphs ◽  
Spin Networks ◽  
Chemical Graph Theory ◽  
State Transfer ◽  
Vertex Set ◽  
Unitary Cayley Graph

The integral circulant graph $X_n (D)$ has the vertex set $Z_n = \{0, 1,\ldots$, $n{-}1\}$ and vertices $a$ and $b$ are adjacent, if and only if $\gcd(a{-}b$, $n)\in D$, where $D = \{d_1,d_2, \ldots, d_k\}$ is a set of divisors of $n$. These graphs play an important role in modeling quantum spin networks supporting the perfect state transfer and also have applications in chemical graph theory. In this paper, we deal with the automorphism group of integral circulant graphs and investigate a problem proposed in [W. Klotz, T. Sander, Some properties of unitary Cayley graphs, Electr. J. Comb. 14 (2007), #R45]. We determine the size and the structure of the automorphism group of the unitary Cayley graph $X_n (1)$ and the disconnected graph $X_n (d)$. In addition, based on the generalized formula for the number of common neighbors and the wreath product, we completely characterize the automorphism groups $Aut (X_n (1, p))$ for $n$ being a square-free number and $p$ a prime dividing $n$, and $Aut (X_n (1, p^k))$ for $n$ being a prime power.

scholarly journals Automorphisms and Enumeration of Switching Classes of Tournaments.

10.37236/1516 ◽  
2000 ◽  
Vol 7 (1) ◽  
Author(s):  
L. Babai ◽  
P. J. Cameron
Keyword(s):  
Automorphism Group ◽  
Automorphism Groups ◽  
Probability Distributions ◽  
Explicit Construction ◽  
Linear Orders ◽  
Full Automorphism Group ◽  
Odd Order ◽  
Vertex Set ◽  
Countably Infinite ◽  
Switching Class

Two tournaments $T_1$ and $T_2$ on the same vertex set $X$ are said to be switching equivalent if $X$ has a subset $Y$ such that $T_2$ arises from $T_1$ by switching all arcs between $Y$ and its complement $X\setminus Y$. The main result of this paper is a characterisation of the abstract finite groups which are full automorphism groups of switching classes of tournaments: they are those whose Sylow 2-subgroups are cyclic or dihedral. Moreover, if $G$ is such a group, then there is a switching class $C$, with Aut$(C)\cong G$, such that every subgroup of $G$ of odd order is the full automorphism group of some tournament in $C$. Unlike previous results of this type, we do not give an explicit construction, but only an existence proof. The proof follows as a special case of a result on the full automorphism group of random $G$-invariant digraphs selected from a certain class of probability distributions. We also show that a permutation group $G$, acting on a set $X$, is contained in the automorphism group of some switching class of tournaments with vertex set $X$ if and only if the Sylow 2-subgroups of $G$ are cyclic or dihedral and act semiregularly on $X$. Applying this result to individual permutations leads to an enumeration of switching classes, of switching classes admitting odd permutations, and of tournaments in a switching class. We conclude by remarking that both the class of switching classes of finite tournaments, and the class of "local orders" (that is, tournaments switching-equivalent to linear orders), give rise to countably infinite structures with interesting automorphism groups (by a theorem of Fraïssé).

Sign in / Sign up

Export Citation Format

Share Document