• Journal of applied mathematics & informatics
• /
• v.42 no.3
• /
• pp.663-680
• /
• 2024

The zero divisor graph is the most basic way of representing an algebraic structure as a graph. For any commutative ring R, each element is a vertex on the zero divisor graph and two vertices are defined as adjacent if and only if the product of those vertices equals zero. In this research, we determine some topological indices such as the Wiener index, the edge-Wiener index, the hyper-Wiener index, the Harary index, the first Zagreb index, the second Zagreb index, and the Gutman index of zero divisor graph of integers modulo prime power and its direct product.

• Journal of the Korean Mathematical Society
• /
• v.47 no.2
• /
• pp.311-329
• /
• 2010

In this paper we will prove that the groups $D_{p+1}$(2) and $D_{p+1}$(3), where p is an odd prime number, are uniquely determined by their sets of order components. A main consequence of our result is the validity of Thompson's conjecture for the groups $D_{p+1}$(2) and $D_{p+1}$(3).

• Journal of the Korean Mathematical Society
• /
• v.45 no.1
• /
• pp.137-150
• /
• 2008

In this paper we will prove that the simple groups $B_p(3)\;and\;G_p(3)$, p an odd prime number, are 2-recognizable by the set of their order components. More precisely we will prove that if G is a finite group and OC(G) denotes the set of order components of G, then OC(G) = $OC(B_p(3))$ if and only if $G{\cong}B_p(3)\;or\;C_p(3)$.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.12
• /
• pp.2187-2192
• /
• 2006

This paper presents a method of constructing the universal multiple processing element unit(UMPEU) by De Bruijn Graph. The second method is as following. First, we propose transformation operators in order to construct the De Bruijn UMPEU using properties of graph. Second, we construct the transformation table of De Bruijn graph using above transformation operators. Finally we construct the De Bruijn graph using transformation table. The proposed UMPEU be able to construct the De Bruijn graph for any prime number and integer value of finite fields. Also the UMPEU is applied to fault-tolerant computing system, pipeline class. parallel processing network, switching function and its circuits.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.657-660
• /
• 2000

This paper proposes a Data-Flow-Graph (DFG) restructuring to reduce calculating errors in loop folding scheduling. The prime cause of calculating error is rounding errors due to the restriction of the operation digit of functional units. This rounding error is increased more by using multipliers than adders, so reducing the number of multiplications and putting off them as much as possible reduce rounding errors. The proposed approach reduces the number of multiplications by restructuring DFG in loop folding.

• Bulletin of the Korean Mathematical Society
• /
• v.50 no.1
• /
• pp.117-123
• /
• 2013

Let G be a finite non-abelian group. We define the non-commuting graph ${\nabla}(G)$ of G as follows: the vertex set of ${\nabla}(G)$ is G-Z(G) and two vertices x and y are adjacent if and only if $xy{\neq}yx$. In this paper we prove that if G is a finite group with $${\nabla}(G){\simeq_-}{\nabla}(\mathbb{A}_{22})$$, then $$G{\simeq_-}\mathbb{A}_{22}$$where $\mathbb{A}_{22}$ is the alternating group of degree 22.

• Journal of the Korean Mathematical Society
• /
• v.51 no.3
• /
• pp.593-607
• /
• 2014

Let R be an I-semiring and S(R) be the set of all identity-summand elements of R. In this paper we introduce the total graph of R with respect to identity-summand elements, denoted by T(${\Gamma}(R)$), and investigate basic properties of S(R) which help us to gain interesting results about T(${\Gamma}(R)$) and its subgraphs.

• Journal of the Korean Mathematical Society
• /
• v.51 no.1
• /
• pp.87-98
• /
• 2014

Let R be a commutative ring with identity and M an R-module. In this paper, we associate a graph to M, say ${\Gamma}(M)$, such that when M = R, ${\Gamma}(M)$ is exactly the classic zero-divisor graph. Many well-known results by D. F. Anderson and P. S. Livingston, in [5], and by D. F. Anderson and S. B. Mulay, in [6], have been generalized for ${\Gamma}(M)$ in the present article. We show that ${\Gamma}(M)$ is connected with $diam({\Gamma}(M)){\leq}3$. We also show that for a reduced module M with $Z(M)^*{\neq}M{\backslash}\{0\}$, $gr({\Gamma}(M))={\infty}$ if and only if ${\Gamma}(M)$ is a star graph. Furthermore, we show that for a finitely generated semisimple R-module M such that its homogeneous components are simple, $x,y{\in}M{\backslash}\{0\}$ are adjacent if and only if $xR{\cap}yR=(0)$. Among other things, it is also observed that ${\Gamma}(M)={\emptyset}$ if and only if M is uniform, ann(M) is a radical ideal, and $Z(M)^*{\neq}M{\backslash}\{0\}$, if and only if ann(M) is prime and $Z(M)^*{\neq}M{\backslash}\{0\}$.

• Bulletin of the Korean Mathematical Society
• /
• v.51 no.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.

• Communications of the Korean Mathematical Society
• /
• v.27 no.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)$.