scholarly journals Automorphism group of the complete alternating group graph

2017 ◽  
Vol 314 ◽  
pp. 58-64 ◽  
Author(s):  
Xueyi Huang ◽  
Qiongxiang Huang
Keyword(s):  
Automorphism Group ◽  
Alternating Group ◽  
Alternating Group Graph

A 2-ARC TRANSITIVE PENTAVALENT CAYLEY GRAPH OF 

2016 ◽  
Vol 93 (3) ◽  
pp. 441-446 ◽  
Author(s):  
BO LING ◽  
BEN GONG LOU
Keyword(s):  
Automorphism Group ◽  
Cayley Graph ◽  
Cayley Graphs ◽  
Discrete Math ◽  
Simple Groups ◽  
Alternating Group ◽  
Full Automorphism Group ◽  
Symmetric Graphs

Zhou and Feng [‘On symmetric graphs of valency five’, Discrete Math. 310 (2010), 1725–1732] proved that all connected pentavalent 1-transitive Cayley graphs of finite nonabelian simple groups are normal. We construct an example of a nonnormal 2-arc transitive pentavalent symmetric Cayley graph on the alternating group $\text{A}_{39}$. Furthermore, we show that the full automorphism group of this graph is isomorphic to the alternating group $\text{A}_{40}$.

scholarly journals Geometry of the Wiman–Edge monodromy

2021 ◽  
pp. 1-29
Author(s):  
Matthew Stover
Keyword(s):  
Automorphism Group ◽  
Modular Group ◽  
Alternating Group ◽  
Projective Surface ◽  
Congruence Condition ◽  
Symmetric Manifold ◽  
New Information ◽  
Hilbert Modular Group ◽  
Hilbert Modular ◽  
Surface Of General Type

The Wiman–Edge pencil is a pencil of genus 6 curves for which the generic member has automorphism group the alternating group [Formula: see text]. There is a unique smooth member, the Wiman sextic, with automorphism group the symmetric group [Formula: see text]. Farb and Looijenga proved that the monodromy of the Wiman–Edge pencil is commensurable with the Hilbert modular group [Formula: see text]. In this note, we give a complete description of the monodromy by congruence conditions modulo 4 and 5. The congruence condition modulo 4 is new, and this answers a question of Farb–Looijenga. We also show that the smooth resolution of the Baily–Borel compactification of the locally symmetric manifold associated with the monodromy is a projective surface of general type. Lastly, we give new information about the image of the period map for the pencil.

scholarly journals A 2-arc Transitive Hexavalent Nonnormal Cayley Graph on A119

Mathematics ◽  
2021 ◽  
Vol 9 (22) ◽  
pp. 2935
Author(s):  
Bo Ling ◽  
Wanting Li ◽  
Bengong Lou
Keyword(s):  
Automorphism Group ◽  
Cayley Graph ◽  
Automorphism Groups ◽  
Cayley Graphs ◽  
Vital Role ◽  
Alternating Group ◽  
Full Automorphism Group ◽  
Base Group

A Cayley graph Γ=Cay(G,S) is said to be normal if the base group G is normal in AutΓ. The concept of the normality of Cayley graphs was first proposed by M.Y. Xu in 1998 and it plays a vital role in determining the full automorphism groups of Cayley graphs. In this paper, we construct an example of a 2-arc transitive hexavalent nonnormal Cayley graph on the alternating group A119. Furthermore, we determine the full automorphism group of this graph and show that it is isomorphic to A120.

A Note on the Nature Diagnosability of Alternating Group Graphs Under the PMC Model and MM* Model

2018 ◽  
Vol 18 (01) ◽  
pp. 1850005 ◽  
Author(s):  
SHIYING WANG ◽  
LINGQI ZHAO
Keyword(s):  
Interconnection Networks ◽  
Interconnection Network ◽  
Alternating Group ◽  
Multiprocessor System ◽  
Multiprocessor Systems ◽  
Free Node ◽  
Pmc Model ◽  
Important Study ◽  
Communication Links ◽  
Alternating Group Graph

Many multiprocessor systems have interconnection networks as underlying topologies and an interconnection network is usually represented by a graph where nodes represent processors and links represent communication links between processors. No faulty set can contain all the neighbors of any fault-free node in the system, which is called the nature diagnosability of the system. Diagnosability of a multiprocessor system is one important study topic. As a favorable topology structure of interconnection networks, the n-dimensional alternating group graph AGn has many good properties. In this paper, we prove the following. (1) The nature diagnosability of AGn is 4n − 10 for n − 5 under the PMC model and MM* model. (2) The nature diagnosability of the 4-dimensional alternating group graph AG4 under the PMC model is 5. (3) The nature diagnosability of AG4 under the MM* model is 4.

Neighbor Connectivity of the Alternating Group Graph

2021 ◽  
pp. 2150014
Author(s):  
Mohamad Abdallah ◽  
Chun-Nan Hung
Keyword(s):  
Alternating Group ◽  
Empty Graph ◽  
Neighbor Connectivity ◽  
Alternating Group Graph

Given a graph [Formula: see text], its neighbor connectivity is the least number of vertices whose deletion along with their neighbors results in a disconnected, complete, or empty graph. The edge neighbor connectivity is the least number of edges whose deletion along with their endpoints results in a disconnected, complete, or empty graph. In this paper, we determine the neighbor connectivity [Formula: see text] and the edge neighbor connectivity [Formula: see text] of the alternating group graph. We show that [Formula: see text], where [Formula: see text] is the [Formula: see text]-dimensional alternating group graph.

THE Qn,k,m GRAPH: A COMMON GENERALIZATION OF VARIOUS POPULAR INTERCONNECTION NETWORKS

2013 ◽  
Vol 23 (03) ◽  
pp. 1350011 ◽  
Author(s):  
EDDIE CHENG ◽  
NART SHAWASH
Keyword(s):  
Interconnection Networks ◽  
Cayley Graphs ◽  
Alternating Group ◽  
Star Graph ◽  
Strong Connectivity ◽  
Common Generalization ◽  
Arrangement Graph ◽  
Special Case ◽  
Alternating Group Graph

The star graph and the alternating group graph were introduced as competitive alternatives to the hypercube, and they are indeed superior over the hypercube under many measures. However, they do suffer from scaling issues. To address this, different generalizations, namely, the (n,k)-star graph and the arrangement graph were introduced to address this shortcoming. From another direction, the star graph was recognized as a special case of Cayley graphs whose generators can be associated with a tree. Nevertheless, all these networks appear to be very different and yet share many properties. In this paper, we will solve this mystery by providing a common generalization of all these networks. Moreover, we will show that these networks have strong connectivity properties.

Sign in / Sign up

Export Citation Format

Share Document