http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : Mahsa Mirzargar (검색결과 2 건)
- 무료
- 기관 내 무료
- 유료
-
THE AUTOMORPHISM GROUP OF COMMUTING GRAPH OF A FINITE GROUP
Mirzargar, Mahsa,Pach, Peter P.,Ashrafi, A.R. Korean Mathematical Society 2014 대한수학회보 Vol.51 No.4
Let G be a finite group and X be a union of conjugacy classes of G. Define C(G,X) to be the graph with vertex set X and $x,y{\in}X$ ($x{\neq}y$) joined by an edge whenever they commute. In the case that X = G, this graph is named commuting graph of G, denoted by ${\Delta}(G)$. The aim of this paper is to study the automorphism group of the commuting graph. It is proved that Aut(${\Delta}(G)$) is abelian if and only if ${\mid}G{\mid}{\leq}2$; ${\mid}Aut({\Delta}(G)){\mid}$ is of prime power if and only if ${\mid}G{\mid}{\leq}2$, and ${\mid}Aut({\Delta}(G)){\mid}$ is square-free if and only if ${\mid}G{\mid}{\leq}3$. Some new graphs that are useful in studying the automorphism group of ${\Delta}(G)$ are presented and their main properties are investigated.
-
The automorphism group of commuting graph of a finite group
Mahsa Mirzargar,Peter P. Pach,A. R. Ashrafi 대한수학회 2014 대한수학회보 Vol.51 No.4
Let G be a finite group and X be a union of conjugacy classes of G. Define C(G,X) to be the graph with vertex set X and x, y ∈ X (x ≠ y) joined by an edge whenever they commute. In the case that X = G, this graph is named commuting graph of G, denoted by △(G). The aim of this paper is to study the automorphism group of the commuting graph. It is proved that Aut(△(G)) is abelian if and only if |G| ≤ 2 |Aut(△(G))| is of prime power if and only if |G| ≤ 2, and |Aut(△(G))| is square-free if and only if |G| ≤ 3. Some new graphs that are useful in studying the automorphism group of △(G) are presented and their main properties are investigated.
연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
