• Kyungpook Mathematical Journal
• /
• v.58 no.3
• /
• pp.573-581
• /
• 2018

In this paper we consider all orientation-preserving ${\mathbb{Z}}_{p^2}$-actions on 3-dimensional handlebodies $V_g$ of genus g > 0 for p an odd prime. To do so, we examine particular graphs of groups (${\Gamma}(v)$, G(v)) in canonical form for some 5-tuple v = (r, s, t, m, n) with r + s + t + m > 0. These graphs of groups correspond to the handlebody orbifolds V (${\Gamma}(v)$, G(v)) that are homeomorphic to the quotient spaces $V_g/{\mathbb{Z}}_{p^2}$ of genus less than or equal to g. This algebraic characterization is used to enumerate the total number of ${\mathbb{Z}}_{p^2}$-actions on such handlebodies, up to equivalence.

• Communications of the Korean Mathematical Society
• /
• v.15 no.3
• /
• pp.521-531
• /
• 2000

Graph C*-algebras C*(E) are the universal C*-algebras generated by partial isometries satisfying the Cuntz-Krieger relations determined by directed graphs E, and it is known that a simple graph C*-algebra is extremally rich in sense that it contains enough extreme consider a sufficient condition on a graph for which the associated graph algebra(possibly nonsimple) is extremally rich. We also present examples of nonextremally rich prime graph C*-algebras with finitely many ideals and with real rank zero.

• Bulletin of the Korean Mathematical Society
• /
• v.59 no.1
• /
• pp.203-212
• /
• 2022

A simple graph is called semi-symmetric if it is regular and edge transitive but not vertex transitive. In this paper we prove that there is no connected cubic semi-symmetric graph of order 12p³ for any prime number p.

• Communications of the Korean Mathematical Society
• /
• v.38 no.3
• /
• pp.937-941
• /
• 2023

For each positive integer n, a square congruence graph S(n) is the graph with vertex set H = {1, 2, 3,...., n} and two vertices a, b are adjacent if they are distinct and a² ≡ b² (mod n). In this paper we investigate some structural properties of square congruence graph and we obtain the relationship between clique number, chromatic number and maximum degree of square congruence graph. Also we study square congruence graph with p vertices or 2p vertices for any prime number p.

• 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.

• Journal of Educational Research in Mathematics
• /
• v.25 no.1
• /
• pp.1-19
• /
• 2015

This paper aims to explore what we can improve in the curriculum, teaching-learning, and evaluation on the bases of the analyses of multiple-choice items set in National Assessment of Educational Achievement. For this goal, by using the distribution curves of the responses percentages, we will grasp the features of educational achievement which appear to students through an in-depth analysis about not only item itself but also the contents included in particular distracters. These analyses provide more information than the descriptive statistical values such as the mean of correct answer percentage and the discrimination of whole group and the mean of responses percentages of replies of subgroups. Because the distribution curves of the responses percentages reveal the transition from the lowest to the highest educational achievement very well. From these analyses we acquire the implications about the concept of prime factor or prime factorization, ratio(proportion) such as velocity, linear function, volume of cone, properties of solid figure, and probabilities of empty event and total event.

• 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 Pure and Applied Mathematics
• /
• v.14 no.2 s.36
• /
• pp.85-90
• /
• 2007

Arguably the most important internet technology of today is RIA (rich internet application), whose prime advantage is in improving the user experience on the web. However, the scope and variety of the RIA technology demand an eclectic guideline to build the mathematical services such as mathematical text, graphs, and animations. This paper sorts out and simplifies the complicated roadmap of the RIA technologies by presenting three design patterns for exposing the functionality of the CAS (computer algebra system) with the web browser as the user interface platform.

• Bulletin of the Korean Mathematical Society
• /
• v.59 no.6
• /
• pp.1327-1337
• /
• 2022

Zero-difference balanced (ZDB) functions can be applied to many areas like optimal constant composition codes, optimal frequency hopping sequences etc. Moreover, it has been shown that the image set of some ZDB functions is a regular partial difference set, and hence provides strongly regular graphs. Besides, perfect nonlinear functions are zero-difference balanced functions. However, the converse is not true in general. In this paper, we use the decomposition of cyclotomic polynomials into irreducible factors over 𝔽_p, where p is an odd prime to generalize some recent results on ZDB functions. Also we extend a result introduced by Claude et al. [3] regarding zero-difference-p-balanced functions over 𝔽_pⁿ. Eventually, we use these results to construct some optimal constant composition codes.

• 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.