• Journal of the Korean Mathematical Society
• /
• v.49 no.1
• /
• pp.85-98
• /
• 2012

Let R be a commutative ring and I its proper ideal, let S(I) be the set of all elements of R that are not prime to I. Here we introduce and study the total graph of a commutative ring R with respect to proper ideal I, denoted by T(${\Gamma}_I(R)$). It is the (undirected) graph with all elements of R as vertices, and for distinct x, y ${\in}$ R, the vertices x and y are adjacent if and only if x + y ${\in}$ S(I). The total graph of a commutative ring, that denoted by T(${\Gamma}(R)$), is the graph where the vertices are all elements of R and where there is an undirected edge between two distinct vertices x and y if and only if x + y ${\in}$ Z(R) which is due to Anderson and Badawi [2]. In the case I = {0}, $T({\Gamma}_I(R))=T({\Gamma}(R))$; this is an important result on the definition.

• Journal of the Korean Mathematical Society
• /
• v.45 no.6
• /
• pp.1647-1659
• /
• 2008

Let R be a ring with identity, X the set of all nonzero, nonunits of R and G the group of all units of R. First, we investigate some connected conditions of the zero-divisor graph $\Gamma(R)$ of a noncommutative ring R as follows: (1) if $\Gamma(R)$ has no sources and no sinks, then $\Gamma(R)$ is connected and diameter of $\Gamma(R)$, denoted by diam($\Gamma(R)$) (resp. girth of $\Gamma(R)$, denoted by g($\Gamma(R)$)) is equal to or less than 3; (2) if X is a union of finite number of orbits under the left (resp. right) regular action on X by G, then $\Gamma(R)$ is connected and diam($\Gamma(R)$) (resp. g($\Gamma(R)$)) is equal to or less than 3, in addition, if R is local, then there is a vertex of $\Gamma(R)$ which is adjacent to every other vertices in $\Gamma(R)$; (3) if R is unit-regular, then $\Gamma(R)$ is connected and diam($\Gamma(R)$) (resp. g($\Gamma(R)$)) is equal to or less than 3. Next, we investigate the graph automorphisms group of $\Gamma(Mat_2(\mathbb{Z}_p))$ where $Mat_2(\mathbb{Z}_p)$ is the ring of 2 by 2 matrices over the galois field $\mathbb{Z}_p$ (p is any prime).

• Communications of the Korean Mathematical Society
• /
• v.24 no.2
• /
• pp.161-169
• /
• 2009

In this paper, we introduce the generalized ideal-based zero-divisor graph structure of near-ring N, denoted by $\widehat{{\Gamma}_I(N)}$. It is shown that if I is a completely reflexive ideal of N, then every two vertices in $\widehat{{\Gamma}_I(N)}$ are connected by a path of length at most 3, and if $\widehat{{\Gamma}_I(N)}$ contains a cycle, then the core K of $\widehat{{\Gamma}_I(N)}$ is a union of triangles and rectangles. We have shown that if $\widehat{{\Gamma}_I(N)}$ is a bipartite graph for a completely semiprime ideal I of N, then N has two prime ideals whose intersection is I.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.5
• /
• pp.263-269
• /
• 2014

In this paper, I disprove Hadwiger conjecture of the vertex coloring problem, which asserts that "All $K_k$-minor free graphs can be colored with k-1 number of colors, i.e., ${\chi}(G)=k$ given $K_k$-minor." Pursuant to Hadwiger conjecture, one shall obtain an NP-complete k-minor to determine ${\chi}(G)=k$, and solve another NP-complete vertex coloring problem as a means to color vertices. In order to disprove Hadwiger conjecture in this paper, I propose an algorithm of linear time complexity O(V) that yields the exact solution to the vertex coloring problem. The proposed algorithm assigns vertex with the minimum degree to the Maximum Independent Set (MIS) and repeats this process on a simplified graph derived by deleting adjacent edges to the MIS vertex so as to finally obtain an MIS with a single color. Next, it repeats the process on a simplified graph derived by deleting edges of the MIS vertex to obtain an MIS whose number of vertex color corresponds to ${\chi}(G)=k$. Also presented in this paper using the proposed algorithm is an additional algorithm that searches solution of ${\chi}^{{\prime}{\prime}}(G)$, the total chromatic number, which also remains NP-complete. When applied to a $K_4$-minor graph, the proposed algorithm has obtained ${\chi}(G)=3$ instead of ${\chi}(G)=4$, proving that the Hadwiger conjecture is not universally applicable to all the graphs. The proposed algorithm, however, is a simple algorithm that directly obtains an independent set minor of ${\chi}(G)=k$ to assign an equal color to the vertices of each independent set without having to determine minors in the first place.

• Bulletin of the Korean Mathematical Society
• /
• v.58 no.4
• /
• pp.1031-1038
• /
• 2021

The main aim of this article is to study quantitative structure of finite simple exceptional groups F₄(2ⁿ) with n > 1. Here, we prove that the finite simple exceptional groups F₄(2ⁿ), where 2⁴ⁿ + 1 is a prime number with n > 1 a power of 2, can be uniquely determined by their orders and the set of the number of elements with the same order. In conclusion, we give a positive answer to J. G. Thompson's problem for finite simple exceptional groups F₄(2ⁿ).

• Journal of applied mathematics & informatics
• /
• v.31 no.5_6
• /
• pp.651-659
• /
• 2013

A graph is $s$-regular if its automorphism group acts regularly on the set of its $s$-arcs. In this paper, the cubic $s$-regular graphs of order 12p, 36p, 44p, 52p, 66p, 68p and 76p are classified for each $s{\geq}1$ and each prime $p$. The number of cubic $s$-regular graphs of order 12p, 36p, 44p, 52p, 66p, 68p and 76p is 4, 3, 7, 8, 1, 4 and 1, respectively. As a partial result, we determine all cubic $s$-regular graphs of order 70p except for $p$ = 31, 41.

• Bulletin of the Korean Mathematical Society
• /
• v.56 no.6
• /
• pp.1485-1495
• /
• 2019

The purpose of this paper is to compute the number of semistar operations of certain classes of finite dimensional $Pr{\ddot{u}}fer$ domains. We prove that ${\mid}SStar(R){\mid}={\mid}Star(R){\mid}+{\mid}Spec(R){\mid}+ {\mid}Idem(R){\mid}$ where Idem(R) is the set of all nonzero idempotent prime ideals of R if and only if R is a $Pr{\ddot{u}}fer$ domain with Y -graph spectrum, that is, R is a $Pr{\ddot{u}}fer$ domain with exactly two maximal ideals M and N and $Spec(R)=\{(0){\varsubsetneq}P_1{\varsubsetneq}{\cdots}{\varsubsetneq}P_{n-1}{\varsubsetneq}M,N{\mid}P_{n-1}{\varsubsetneq}N\}$. We also characterize non-local $Pr{\ddot{u}}fer$ domains R such that ${\mid}SStar(R){\mid}=7$, respectively ${\mid}SStar(R){\mid}=14$.

• Bulletin of the Korean Mathematical Society
• /
• v.56 no.3
• /
• pp.729-743
• /
• 2019

In this paper, we introduce strongly quasi primary ideals which is an intermediate class of primary ideals and quasi primary ideals. Let R be a commutative ring with nonzero identity and Q a proper ideal of R. Then Q is called strongly quasi primary if $ab{\in}Q$ for $a,b{\in}R$ implies either $a^2{\in}Q$ or $b^n{\in}Q$ ($a^n{\in}Q$ or $b^2{\in}Q$) for some $n{\in}{\mathbb{N}}$. We give many properties of strongly quasi primary ideals and investigate the relations between strongly quasi primary ideals and other classical ideals such as primary, 2-prime and quasi primary ideals. Among other results, we give a characterization of divided rings in terms of strongly quasi primary ideals. Also, we construct a subgraph of ideal based zero divisor graph ${\Gamma}_I(R)$ and denote it by ${\Gamma}^*_I(R)$, where I is an ideal of R. We investigate the relations between ${\Gamma}^*_I(R)$ and ${\Gamma}_I(R)$. Further, we use strongly quasi primary ideals and ${\Gamma}^*_I(R)$ to characterize von Neumann regular rings.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.9
• /
• pp.4788-4813
• /
• 2019

In this paper, we introduce concepts of optimal and near optimal secret data hiding schemes. We present a new digital image steganography approach based on the Galois field $GF(p^m)$ using graph and automata to design the data hiding scheme of the general form ($k,N,{\lfloor}{\log}_2p^{mn}{\rfloor}$) for binary, gray and palette images with the given assumptions, where k, m, n, N are positive integers and p is prime, show the sufficient conditions for the existence and prove the existence of some optimal and near optimal secret data hiding schemes. These results are derived from the concept of the maximal secret data ratio of embedded bits, the module approach and the fastest optimal parity assignment method proposed by Huy et al. in 2011 and 2013. An application of the schemes to the process of hiding a finite sequence of secret data in an image is also considered. Security analyses and experimental results confirm that our approach can create steganographic schemes which achieve high efficiency in embedding capacity, visual quality, speed as well as security, which are key properties of steganography.

• Communications of the Korean Mathematical Society
• /
• v.38 no.1
• /
• pp.39-46
• /
• 2023

Let R be a commutative ring, M be a Noetherian R-module, and N a 2-absorbing submodule of M such that r(N :_R M) = 𝖕 is a prime ideal of R. The main result of the paper states that if N = Q₁ ∩ ⋯ ∩ Q_n with r(Q_i :_R M) = 𝖕_i, for i = 1, . . . , n, is a minimal primary decomposition of N, then the following statements are true. (i) 𝖕 = 𝖕_k for some 1 ≤ k ≤ n. (ii) For each j = 1, . . . , n there exists m_j ∈ M such that 𝖕_j = (N :_R m_j). (iii) For each i, j = 1, . . . , n either 𝖕_i ⊆ 𝖕_j or 𝖕_j ⊆ 𝖕_i. Let Γ_E(M) denote the zero-divisor graph of equivalence classes of zero divisors of M. It is shown that {Q₁∩ ⋯ ∩Q_n-1, Q₁∩ ⋯ ∩Q_n-2, . . . , Q₁} is an independent subset of V (Γ_E(M)), whenever the zero submodule of M is a 2-absorbing submodule and Q₁ ∩ ⋯ ∩ Q_n = 0 is its minimal primary decomposition. Furthermore, it is proved that Γ_E(M)[(0 :_R M)], the induced subgraph of Γ_E(M) by (0 :_R M), is complete.