• Journal of the Korean Mathematical Society
• /
• v.60 no.1
• /
• pp.71-90
• /
• 2023

We construct generalized Cauchy-Riemann equations of the first order for a pair of two ℝ-valued functions to deform a minimal graph in ℝ³ to the one parameter family of the two dimensional minimal graphs in ℝ⁴. We construct the two parameter family of minimal graphs in ℝ⁴, which include catenoids, helicoids, planes in ℝ³, and complex logarithmic graphs in ℂ². We present higher codimensional generalizations of Scherk's periodic minimal surfaces.

• Journal of the Chungcheong Mathematical Society
• /
• v.23 no.2
• /
• pp.251-256
• /
• 2010

In this article, we consider a minimal graph in $R^3$ which is bounded by a Jordan curve and a straight line. Suppose that the boundary is symmetric with the reflection under a plane, then we will prove that the minimal graph is itself symmetric under the reflection through the same plane.

• Journal of applied mathematics & informatics
• /
• v.5 no.3
• /
• pp.771-784
• /
• 1998

In this paper we propose an algorithm for generating minimal cutsets of undirected graphs. The algorithm is based on a blocking mechanism for generating every minimal cutest ex-actly once. The algorithm has an advantage of not requiring any preliminary steps to find minimal cutsets. The algorithm generates minimal cutsets at O(e.n) {where e,n = number of (edges, vertices) in the graph} computational effort per cutset. Formal proofs of the algorithm are presented.

• Journal of the Chungcheong Mathematical Society
• /
• v.24 no.2
• /
• pp.313-317
• /
• 2011

In this article, we consider an unbounded minimal graph $M{\subset}R^3$ which is contained in a slab. Assume that ${\partial}M$ consists of two Jordan curves lying in parallel planes, which is symmetric with the reflection under a plane. If the asymptotic behavior of M is also symmetric in some sense, then we prove that the minimal graph is itself symmetric along the same plane.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.1
• /
• pp.11-20
• /
• 1995

A new graph problem is formulated to limit the maximum path length of a general directed graph when a minimal set of vertices together with their incident edges are removed from the graph. An optimal algorithm and a heuristic algorithm are proposed and the proposed heuristic algorithm is shown to be effective through experiments using a collection of graphs obtained from large sequential circuits. The heuristic algorithm is based on a feedback vertex set algorithm based on graph reduction.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.21 no.1
• /
• pp.57-61
• /
• 1984

This paper deals with the selection of minimal test instruction set for microprocessor data processing test. This test method is based on a function description of the instructions which are obtained from the data given by the user's manual. Selecting procedure is done in 3 steps: 1) a test execution graphs are represented on the instructions which are grouped functionally, 2) the essential graphs, the eliminable graphs, the eliminable graphs, and the eligible graphs are built, 3) optimal test instruction set from the essential graphs and the eligible graphs is defined. In the case of INTEL 8048, 50 test instructions can be selected optimally from 8048 instruction repertories (96 instructions)

• The Journal of Korean Association of Computer Education
• /
• v.21 no.6
• /
• pp.39-47
• /
• 2018

This paper dealt with investigating the number of minimal spanning ladders originated from ladder game and their properties as well as the related computational thinking aspects. The author modified the filtering techniques to enhance Mathematica project where a new type of graph was generated based on the algorithm using a generator of firstly found minimal spanning graph by repeatedly applying independent ladder operator to a subsequence of ladder sequence. The newly produced YC graphs had recursive and hierarchical graph structures and showed the properties of edge-symmetric. As the computational complexity increased the author divided the whole search space into the each floor of the newly generated minimal spanning graphs for the (5, 10) YC graph and the higher (6, 15) YC graph. It turned out that the computational thinking capabilities such as data visualization, abstraction, and parallel computing with Mathematica contributed to enumerating the new YC graphs in order to investigate their structures and properties.

• Journal of the Korean Mathematical Society
• /
• v.58 no.1
• /
• pp.109-122
• /
• 2021

In this paper, we consider the problem of finding the hypersurface Mn in the Euclidean (n + 1)-space ℝn+1 that satisfies an equation of mean curvature type, called singular minimal hypersurface equation. Such an equation physically characterizes the surfaces in the upper half-space ℝ+3 (u) with lowest gravity center, for a fixed unit vector u ∈ ℝ3. We first state that a singular minimal cylinder Mn in ℝn+1 is either a hyperplane or a α-catenary cylinder. It is also shown that this result remains true when Mn is a translation hypersurface and u is a horizantal vector. As a further application, we prove that a singular minimal translation graph in ℝ3 of the form z = f(x) + g(y + cx), c ∈ ℝ - {0}, with respect to a certain horizantal vector u is either a plane or a α-catenary cylinder.

• Communications of the Korean Mathematical Society
• /
• v.30 no.1
• /
• pp.45-64
• /
• 2015

In this article, we consider a proper total coloring distinguishes adjacent vertices by sums, if every two adjacent vertices have different total sum of colors of the edges incident to the vertex and the color of the vertex. Pilsniak and Wozniak [15] first introduced this coloring and made a conjecture that the minimal number of colors need to have a proper total coloring distinguishes adjacent vertices by sums is less than or equal to the maximum degree plus 3. We study proper total colorings distinguishing adjacent vertices by sums of some graphs and their products. We prove that these graphs satisfy the conjecture.

• Journal of the Korean Mathematical Society
• /
• v.56 no.5
• /
• pp.1173-1246
• /
• 2019

We find all P-resolutions of quotient surface singularities (especially, tetrahedral, octahedral, and icosahedral singularities) together with their dual graphs, which reproduces (a corrected version of) Jan Steven's list [Manuscripta Math. 1993] of the numbers of P-resolutions of each singularities. We then compute the dimensions and Milnor numbers of the corresponding irreducible components of the reduced base spaces of versal deformations of each singularities. Furthermore we realize Milnor fibers as complements of certain divisors (depending only on the singularities) in rational surfaces via the semi-stable minimal model program for 3-folds. Then we compare Milnor fibers with minimal symplectic fillings, where the latter are classified by Bhupal and Ono [Nagoya Math. J. 2012]. As an application, we show that there are 6 pairs of entries in the list of Bhupal and Ono [Nagoya Math. J. 2012] such that two entries in each pairs represent diffeomorphic minimal symplectic fillings.