Results 1 to 10 of about 1,639,956 (148)
Classifying cubic symmetric graphs of order 52p2; pp. 55–60 [PDF]
An automorphism group of a graph is said to be s-regular if it acts regularly on the set of s-arcs in the graph. A graph is s-regular if its full automorphism group is s-regular.
Shangjing Hao, Shixun Lin
doaj +1 more source
Simple groups contain minimal simple groups [PDF]
It is a consequence of the classification of finite simple groups that every non-abelian simple group contains a subgroup which is a minimal simple group.
Barry, M. J. J., Ward, M. B.
openaire +6 more sources
A NEW CHARACTERIZATION OF SIMPLE GROUP G 2 (q) WHERE q ⩽ 11 [PDF]
Let G be a finite group , in this paper using the order and largest element order of G we show that every finite group with the same order and largest element order as G 2 (q), where q ⩽ 11 is necessarily isomorphic to the group G 2 (q)
M. Bibak +2 more
doaj +1 more source
A 2-arc Transitive Hexavalent Nonnormal Cayley Graph on A119
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.
Bo Ling, Wanting Li, Bengong Lou
doaj +1 more source
Reduced designs constructed by Key-Moori Method $2$ and their connection with Method $3$ [PDF]
For a 1-$(v,k,\lambda)$ design $\mathcal{D}$ containing a point $x$, we study the set $I_x$, the intersection of all blocks of $\mathcal{D}$ containing $x$.
Amin Saeidi
doaj +1 more source
Symmetric graphs of valency seven and their basic normal quotient graphs
We characterize seven valent symmetric graphs of order 2pqn2p{q}^{n} with ...
Pan Jiangmin, Huang Junjie, Wang Chao
doaj +1 more source
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
On Group-Vertex-Magic Labeling of Simple Graphs
Let A be an Abelian group with identity 0. The A-vertex-magic labeling of a graph G is a mapping from the set of vertices in G to A-{0} such that the sum of the labels of every open neighborhood vertex of v is equal, for every vertex v in G.
Muhammad Husnul Khuluq +2 more
doaj +1 more source
Infinite locally finite simple groups with many complemented subgroups [PDF]
We prove that the following families of (infinite) groups have complemented subgroup lattice: alternating groups, finitary symmetric groups, Suzuki groups over an infinite locally finite field of characteristic $2$, Ree groups over an infinite ...
Maria Ferrara, Marco Trombetti
doaj +1 more source
The first example of a simple 2−(81,6,2) design
We give the very first example of a simple 2−(81,6,2)design. Its points are the elements of the elementary abelian group of order 81 and each block is the union of two parallel lines of the 4-dimensional geometry over the field of order 3.
Anamari Nakic
doaj +1 more source

