• 제목/요약/키워드: prime graphs

검색결과 36건 처리시간 0.024초

THE AUTOMORPHISM GROUP OF COMMUTING GRAPH OF A FINITE GROUP

  • Mirzargar, Mahsa;Pach, Peter P.;Ashrafi, A.R.
    • 대한수학회보
    • /
    • 제51권4호
    • /
    • pp.1145-1153
    • /
    • 2014
  • 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.

ON COMMUTING GRAPHS OF GROUP RING ZnQ8

  • Chen, Jianlong;Gao, Yanyan;Tang, Gaohua
    • 대한수학회논문집
    • /
    • 제27권1호
    • /
    • pp.57-68
    • /
    • 2012
  • The commuting graph of an arbitrary ring R, denoted by ${\Gamma}(R)$, is a graph whose vertices are all non-central elements of R, and two distinct vertices a and b are adjacent if and only if ab = ba. In this paper, we investigate the connectivity, the diameter, the maximum degree and the minimum degree of the commuting graph of group ring $Z_nQ_8$. The main result is that $\Gamma(Z_nQ_8)$ is connected if and only if n is not a prime. If $\Gamma(Z_nQ_8)$ is connected, then diam($Z_nQ_8$)= 3, while $\Gamma(Z_nQ_8)$ is disconnected then every connected component of $\Gamma(Z_nQ_8)$ must be a complete graph with a same size. Further, we obtain the degree of every vertex in $\Gamma(Z_nQ_8)$, the maximum degree and the minimum degree of $\Gamma(Z_nQ_8)$.

재귀원형군과 하이퍼큐브의 고장 감내에 대한 결정적 척도 (Deterministic Measures of Fault-Tolerance in Recursive Circulants and Hypercubes)

  • 박정흠;김희철
    • 한국정보과학회논문지:시스템및이론
    • /
    • 제29권9호
    • /
    • pp.493-502
    • /
    • 2002
  • 다중 컴퓨터 네트워크의 고장 감내에 대한 대표적인 결정적 척도로 연결도와 에지 연결도가 있다. 연결도나 에지 연결도는 어떤 정점 분리 집합이나 에지 분리 집합을 제거했을 때 남은 그래프의 형태를 고려하지 않는다는 문제가 있다. 이러한 단점을 보완하기 위해서 superconnectivity, toughness, scattering number, vertex-integrity, binding number, restricted connectivity와 같은 일반화된 연결성 척도들이 함께 사용된다. 이 논문에서는 재귀원형군과 하이퍼큐브의 고장 감내에 대한 이러한 결정적 척도를 분석하고, 고장 감내 측면에서 비교한다.

최근 경제위기들과 ASEAN 주요국의 무역 (Recent Economic Crises and Foreign Trade in Major ASEAN Countries)

  • 원용걸
    • 동남아시아연구
    • /
    • 제20권3호
    • /
    • pp.41-64
    • /
    • 2010
  • The recent global financial crisis triggered by the sub-prime mortgage debacle in the United States hit hard most ASEAN countries that have just recovered from the unprecedented economic crisis ten years ago. This paper, using individual time-series and panel data from 1990 to 2009, intends to investigate and compare the impacts of the two aforementioned economic crises on trade in the four developing ASEAN countries that encompass Indonesia, Malaysia, the Philippines and Thailand. In doing so, the paper traces the behaviors of main macroeconomic variables before and after the crises on graphs, and then estimates classical export and import demand functions that include real exchange rate, home and foreign GDPs as explanatory variables. In the estimation functions, two dummy variables are added to consider the effects of the two economic crises separately. Individual country data analyses reveal that by and large the 1997 economic crisis seems hit those ASEAN countries' exports and imports harder than the recent global financial crisis. Surprisingly the recent financial crisis turns out more or less statistically insignificant for those countries' export and import performances. The fixed effect model estimation using panel data of those four ASEAN countries also shows that the 1997 economic crisis had affected exports and imports of those countries negatively while the recent global financial crisis was not statistically significant. These results indicate that overall the effect from the 1997 crisis was more devastating than that of the recent global crisis for those ASEAN countries.

미세균열의 간격 분포를 이용한 결의 평가(V) (Evaluation for Rock Cleavage Using Distribution of Microcrack Spacings (V))

  • 박덕원
    • 암석학회지
    • /
    • 제26권3호
    • /
    • pp.297-309
    • /
    • 2017
  • 거창지역의 쥬라기 화강암에 대하여 결의 특성에 대한 분석을 실시하였다. 박편의 확대사진 및 간격-누적빈도 도표에서 도출한 16개 파라미터의 결합을 통하여 결에 대한 종합적인 평가를 실시하였다. 결에 대한 이들 간격의 파라미터의 대표값에 대한 분석 결과를 요약하면 다음과 같다. 첫째, 상기 파라미터는 그룹 I(간격의 빈도수(N), 총 간격($1mm{\geq}$), 상수(a), 지수(${\lambda}$), 지수 직선의 기울기(${\theta}$), 선의 길이(oa') 및 삼각비($sin{\theta}$, $tan{\theta}$) 그리고 그룹 II(평균 간격(Sm), 평균 간격과 중앙 간격 사이의 차이값(Sm-Sme), 밀도(${\rho}$), 선의 길이(oa 및 aa'), 직각삼각형(${\Delta}oaa^{\prime}$)의 면적 및 삼각비($cos{\theta}$)로 분류할 수 있다. 그룹 I에 속하는 8개 파라미터의 값은 H(3번 결, H1+H2)

The Line n-sigraph of a Symmetric n-sigraph-V

  • Reddy, P. Siva Kota;Nagaraja, K.M.;Geetha, M.C.
    • Kyungpook Mathematical Journal
    • /
    • 제54권1호
    • /
    • pp.95-101
    • /
    • 2014
  • An n-tuple ($a_1,a_2,{\ldots},a_n$) is symmetric, if $a_k$ = $a_{n-k+1}$, $1{\leq}k{\leq}n$. Let $H_n$ = {$(a_1,a_2,{\ldots},a_n)$ ; $a_k$ ${\in}$ {+,-}, $a_k$ = $a_{n-k+1}$, $1{\leq}k{\leq}n$} be the set of all symmetric n-tuples. A symmetric n-sigraph (symmetric n-marked graph) is an ordered pair $S_n$ = (G,${\sigma}$) ($S_n$ = (G,${\mu}$)), where G = (V,E) is a graph called the underlying graph of $S_n$ and ${\sigma}$:E ${\rightarrow}H_n({\mu}:V{\rightarrow}H_n)$ is a function. The restricted super line graph of index r of a graph G, denoted by $\mathcal{R}\mathcal{L}_r$(G). The vertices of $\mathcal{R}\mathcal{L}_r$(G) are the r-subsets of E(G) and two vertices P = ${p_1,p_2,{\ldots},p_r}$ and Q = ${q_1,q_2,{\ldots},q_r}$ are adjacent if there exists exactly one pair of edges, say $p_i$ and $q_j$, where $1{\leq}i$, $j{\leq}r$, that are adjacent edges in G. Analogously, one can define the restricted super line symmetric n-sigraph of index r of a symmetric n-sigraph $S_n$ = (G,${\sigma}$) as a symmetric n-sigraph $\mathcal{R}\mathcal{L}_r$($S_n$) = ($\mathcal{R}\mathcal{L}_r(G)$, ${\sigma}$'), where $\mathcal{R}\mathcal{L}_r(G)$ is the underlying graph of $\mathcal{R}\mathcal{L}_r(S_n)$, where for any edge PQ in $\mathcal{R}\mathcal{L}_r(S_n)$, ${\sigma}^{\prime}(PQ)$=${\sigma}(P){\sigma}(Q)$. It is shown that for any symmetric n-sigraph $S_n$, its $\mathcal{R}\mathcal{L}_r(S_n)$ is i-balanced and we offer a structural characterization of super line symmetric n-sigraphs of index r. Further, we characterize symmetric n-sigraphs $S_n$ for which $\mathcal{R}\mathcal{L}_r(S_n)$~$\mathcal{L}_r(S_n)$ and $$\mathcal{R}\mathcal{L}_r(S_n){\sim_=}\mathcal{L}_r(S_n)$$, where ~ and $$\sim_=$$ denotes switching equivalence and isomorphism and $\mathcal{R}\mathcal{L}_r(S_n)$ and $\mathcal{L}_r(S_n)$ are denotes the restricted super line symmetric n-sigraph of index r and super line symmetric n-sigraph of index r of $S_n$ respectively.