A Generalization of Noncommuting Graph via Automorphisms of a Group
โ Scribed by Barati, Z.; Erfanian, A.; Khashyarmanesh, K.; Nafar, Kh.
- Book ID
- 121323613
- Publisher
- Taylor and Francis Group
- Year
- 2013
- Tongue
- English
- Weight
- 163 KB
- Volume
- 42
- Category
- Article
- ISSN
- 0092-7872
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
## Abstract Given a connected graph ฮ of order __n__ and diameter __d__, we establish a tight upper bound for the order of the automorphism group of ฮ as a function of __n__ and __d__, and determine the graphs for which the bound is attained. ยฉ 2011 Wiley Periodicals, Inc. J Graph Theory.
A graph X is said to be 1 2 -transitive if its automorphism group acts transitively on the sets of its vertices and edges but intransitively on the set of its arcs. A construction of a 1 2 -transitive graph of valency 4 and girth 6 with a nonsolvable group of automorphism is given.