## Abstract We investigate the properties of graphs whose automorphism group is the symmetric group. In particular, we characterize graphs on less than 2__n__ points with group __S~n~__, and construct all graphs on __n__ + 3 points with group __S~n~__. Graphs with 2__n__ or more points and group __
β¦ LIBER β¦
A symmetric BIBD with trivial automorphism group
β Scribed by John Wesley Brown; E.T Parker
- Publisher
- Elsevier Science
- Year
- 1985
- Tongue
- English
- Weight
- 382 KB
- Volume
- 40
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Graphs with symmetric automorphism group
β
W. D. Wallis; Katherine Heinrich
π
Article
π
1978
π
John Wiley and Sons
π
English
β 333 KB
Simple Non-trivial Designs with an Arbit
β
Ngo Dac Tuan
π
Article
π
2002
π
Elsevier Science
π
English
β 92 KB
We give a new recursive construction of simple non-trivial designs. Using this construction, we show that given a natural number t and a finite group G; a simple non-trivial t-design admitting an automorphism group isomorphic to G exists. Further, we apply our construction to get a recursive constru
On (v, k, Ξ») graphs and designs with tri
β
F.C Bussemaker; W.H Haemers; J.J Seidel; E Spence
π
Article
π
1989
π
Elsevier Science
π
English
β 633 KB
The Pure Symmetric Automorphisms of a Fr
β
Noel Brady; Jon McCammond; John Meier; Andy Miller
π
Article
π
2001
π
Elsevier Science
π
English
β 177 KB
The pure symmetric automorphism group of a finitely generated free group consists of those automorphisms which send each standard generator to a conjugate of itself. We prove that these groups are duality groups.
Maximal automorphism groups of symmetric
β
Marston Conder
π
Article
π
1988
π
Elsevier Science
π
English
β 828 KB
Semilattices with a group of automorphis
β
M. MarΓ³ti
π
Article
π
1997
π
Springer
π
English
β 288 KB