• 대한수학회지
• /
• 제60권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.

• 충청수학회지
• /
• 제23권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
• /
• 제5권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.

• 충청수학회지
• /
• 제24권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.

• 전자공학회논문지B
• /
• 제32B권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.

• 대한전자공학회논문지
• /
• 제21권1호
• /
• pp.57-61
• /
• 1984

본 논문에서는 마이크로프로세서의 데이터 처리부 시험을 위한 최적시험명령어 \ulcorner을 구하는 방법을 제시하였다. 기본 자료로는 user's manual로부터 얻을 수 있는 명령어 \ulcorner을 이용하였다. 최적시험명령어 선정 과정은 3단계로 설명된다: 1) 기능적으로 분리된 명령어에 대한 시험처리선도의 구성, 2) 필수선도, 제거선도 및 적임선도의 결정, 3) 최적시험명령어 \ulcorner의 확정 INTEL 8048인 경우, 최적의 시험명령어는 명령어 레퍼터리(96개의 명령어) 중 50개이다.

• 컴퓨터교육학회논문지
• /
• 제21권6호
• /
• pp.39-47
• /
• 2018

이 연구는 사다리타기 게임에서 등장하는 사다리 모양에 따른 이산구조를 순열과 조합적 사고, 알고리즘적 구현을 통하여 최소생성사다리를 생성하는 방법과 컴퓨팅 사고력과의 관련성을 탐구하는 내용을 다루었다. 먼저 연구자는 사다리 모양의 세로판과 가로판의 조합에 따라서 생성되는 순열 중에서 역순열에 대응하는 사다리(최소생성사다리)를 필터링 기법과 새로 개선한 알고리즘을 고안하여 Mathematica 프로젝트로 진행하였다. 그 결과 최소생성사다리를 생성원(generator)으로 하는 새로운 그래프를 Mathematica로 창출하여 YC그래프라 이름 붙였으며 그에 대한 속성을 조사하였다. YC그래프는 이전 차원의 그래프를 내포하는 재귀적 구조와 다층 구조를 가졌으며 간선대칭의 특징을 보여주었다. 또한 계산복잡도가 증가함에 따라 세로판 5개, 가로판 10개 사다리부터 층별로 최소생성사다리를 생성하도록 탐색 공간을 분할하는 알고리즘을 적용하였다. 이 과정에서 자료의 시각화, 추상화 및 병렬처리 알고리즘 구현을 통한 컴퓨팅 사고력이 새로운 YC그래프의 창출 및 구조 분석에 기여한 것으로 나타났다.

• 대한수학회지
• /
• 제58권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.

• 대한수학회논문집
• /
• 제30권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.

• 대한수학회지
• /
• 제56권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.