• Structural Engineering and Mechanics
• /
• v.14 no.1
• /
• pp.57-70
• /
• 2002

This work presents an iterative mesh partitioning approach to improve the efficiency of parallel substructure finite element computations. The proposed approach employs an iterative strategy with a set of empirical rules derived from the results of numerical experiments on a number of different finite element meshes. The proposed approach also utilizes state-of-the-art partitioning techniques in its iterative partitioning kernel, a cost function to estimate the computational cost of each submesh, and a mechanism that adjusts element weights to redistribute elements among submeshes during iterative partitioning to partition a mesh into submeshes (or substructures) with balanced computational workloads. In addition, actual parallel finite element structural analyses on several test examples are presented to demonstrate the effectiveness of the approach proposed herein. The results show that the proposed approach can effectively improve the efficiency of parallel substructure finite element computations.

• Journal of applied mathematics & informatics
• /
• v.42 no.2
• /
• pp.367-377
• /
• 2024

Let G = (V, E) be a graph with p-vertices and q-edges and let R^◦ be a finite zero ring of order n. An injective function f : V (G) → {r₁, r₂, _…, r_k}, where r_i ∈ R^◦ is called vertex pair sum k-zero ring labeling, if it is possible to label the vertices x ∈ V with distinct labels from R^◦ such that each edge e = uv is labeled with f(e = uv) = [f(u) + f(v)] (mod n) and the edge labels are distinct. A graph admits such labeling is called vertex pair sum k-zero ring graph. The minimum value of positive integer k for a graph G which admits a vertex pair sum k-zero ring labeling is called the vertex pair sum k-zero ring index denoted by 𝜓_pz(G). In this paper, we defined the vertex pair sum k-zero ring labeling and applied to some graphs.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.643-651
• /
• 2005

In the first part of this paper we investigate several statements concerning infinite maximal planar graphs which are equivalent in finite case. In the second one, for a given induced $\theta$-path (a finite induced path whose endvertices are adjacent to a vertex of infinite degree) in a 4-connected VAP-free maximal planar graph containing a vertex of infinite degree, a new $\theta$-path is constructed such that the resulting fan is tight.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.245-258
• /
• 2005

In this paper we prove that the alternating groups A_n, for n = p, p+1, p+2 and symmetric groups $S_n$, for n = p, p+1, where p$\ge$3 is a prime number, can be uniquely determined by their order components. As one of the important consequence of this characterization we show that the simple groups An, where n = p, p+1, P+2 and p$\ge$3 is prime, satisfy in Thompson's conjecture and Shi's conjecture.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.10
• /
• pp.195-204
• /
• 1996

We suggest a transform method form asynchronous finite state machines (AFSMs) into signal transition graphs (STGs) for speed-independent circuit synthesis. Existing works synthesize nodes in the state graph increases exponentially as the number of input and output signals increases. To overcome the problem of the exponential data complexity, we transform AFSMs into STGs so that the previous synthesis algorihtm form STGs can be applied.Accoridng to the experimental results, it turns out that our synthesis method produces more efficient circuit than the previous synthesis methods.

• Journal of applied mathematics & informatics
• /
• v.22 no.1_2
• /
• pp.577-587
• /
• 2006

We present several properties concerning infinite maximal planar graphs. Results related to the infinite VAP-free planar graphs are also included. Finally, we extend the result of W. Goddard, who showed that every finite 4-connected maximal planar graph is 4-ordered, to infinite strong triangulations.

• Bulletin of the Korean Mathematical Society
• /
• v.42 no.2
• /
• pp.421-432
• /
• 2005

Suppose that an infinite graph G of bounded degree has finite number of ends, each of which is p-regular, where $1. Then we can identify all the positive (bounded, respectively) p-harmonic functions on G.

• Communications of the Korean Mathematical Society
• /
• v.11 no.1
• /
• pp.1-21
• /
• 1996

In this paper the existence of spanning 3-trees in every 3-connected locally finite vertex-accumulation-point-free planer graph is verified, which is an extension of D. Barnette to infinite graphs and which improves the result of the author.

• Communications of the Korean Mathematical Society
• /
• v.34 no.1
• /
• pp.113-125
• /
• 2019

In this paper, we introduce the elimination ideal $I_D(G)$ associated to a simple finite graph G. We obtain the upper bound of Castelnuovo-Mumford regularity of elimination ideal for various classes of graphs.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2006.11a
• /
• pp.819-822
• /
• 2006

This paper has the objects of deciding dynamic instability regions of thick plates on inhomogeneous Pasternak foundation by finite element method and providing kinematic design data for mats and slabs of building structures. In this paper, dynamic stability analysis of tapered opening thick plate is done by use of Serendipity finite element with 8 nodes considering shearing strain of plate. To verify this finite element method, buckling stress and natural frequencies of thick pate with or without in-plane stress are compared with existing solutions. The results are as follow that this finite element solutions with $4{\times}4$ meshes are shown the error of maximum 0.56% about existing solutions, and the larger foundation parameters, the farther dynamic instability regions are from vertical axis of graph presented relation of ${\beta}\;and\;\overline{\omega}/\omega$.