Results 1 to 10 of about 22,256 (275)
ALTERNATING AND SYMMETRIC GROUPS WITH EULERIAN GENERATING GRAPH [PDF]
Given a finite group $G$ , the generating graph $\unicode[STIX]{x1D6E4}(G)$
ANDREA LUCCHINI, CLAUDE MARION
doaj +6 more sources
Minimum Neighborhood of Alternating Group Graphs [PDF]
The minimum neighborhood and combinatorial property are two important indicators of fault tolerance of a multiprocessor system. Given a graph G, θG(q) is the minimum number of vertices adjacent to a set of q vertices of G (1 ≤ q ≤ |V(
Yanze Huang +3 more
doaj +2 more sources
Automorphism group of the complete alternating group graph [PDF]
9 pages, 1 ...
Xueyi Huang, Qiongxiang Huang
exaly +4 more sources
Divisibility Graph for Symmetric and Alternating Groups [PDF]
Let $X$ be a non-empty set of positive integers and $X^*=X\setminus \{1\}$. The divisibility graph $D(X)$ has $X^*$ as the vertex set and there is an edge connecting $a$ and $b$ with $a, b\in X^*$ whenever $a$ divides $b$ or $b$ divides $a$. Let $X=cs~{G}$ be the set of conjugacy class sizes of a group $G$. In this case, we denote $D(cs~{G})$ by $D(G)$.
Mohammad A Iranmanesh +1 more
exaly +3 more sources
The automorphism group of the alternating group graph
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jinxin Zhou
exaly +2 more sources
On groups having the prime graph as alternating and symmetric groups [PDF]
The {\it prime graph} $Γ(G)$ of a finite group $G$ is the graph whose vertex set is the set of prime divisors of $|G|$ and in which two distinct vertices $r$ and $s$ are adjacent if and only if there exists an element of $G$ of order $rs$. Let $A_n$ ($S_n$) denote the alternating (symmetric) group of degree $n$.
Alexey Staroletov, Ilya Gorshkov
exaly +3 more sources
On characterization by order and prime graph for alternating groups
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ali Mahmoudifar +2 more
exaly +2 more sources
Characterization of some alternating groups by order and largest element order [PDF]
The prime graph (or Gruenberg-Kegel graph) of a finite group is a well-known graph. In this paper, first, we investigate the structure of the finite groups with a non-complete prime graph.
Ali Mahmoudifar, Ayoub Gharibkhajeh
doaj +1 more source
A new strongly regular graph with parameters (81,30,9,12) is found as a graph invariant under certain subgroup of the full automorphism group of the previously known strongly regular graph discovered in 1981 by J. H. van Lint and A. Schrijver.
Dean Crnković, Andrea Švob
doaj +1 more source
Metric properties of Cayley graphs of alternating groups
A well known diameter search problem for finite groups with respect to its systems of generators is considered. The problem can be formulated as follows: find the diameter of a group over its system of generators.
M.S. Olshevskyi
doaj +1 more source

