• Bulletin of the Korean Mathematical Society
• /
• v.50 no.3
• /
• pp.801-809
• /
• 2013

In this paper, we construct nilpotent semigroups S such that $S^n=\{0\}$, $S^{n-1}{\neq}\{0\}$ and ${\Gamma}(S)$ is a refinement of the star graph $K_{1,n-3}$ with center $c$ together with finitely many or infinitely many end vertices adjacent to $c$, for each finite positive integer $n{\geq}5$. We also give counting formulae to calculate the number of the mutually non-isomorphic nilpotent semigroups when $n=5$, 6 and in finite cases.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.9
• /
• pp.2091-2096
• /
• 2013

This paper present a method of efficiency circuit design based on directed graph which was represented by tree structure relationship between input and output of nodes. In this paper, we introduce the concept of mathematical analysis based on tree structure which was designed by optimal localized computable circuit. Using the proposed circuit design algorithms in this paper, it is possible to design circuit which directed tree graph have any node number. The proposed method is more effective, regularity and extensibility than former method.

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

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2005.11a
• /
• pp.788-791
• /
• 2005

Nodal displacements are referred to the Initial configuration in the total Lagrangian formulation and to the last converged configuration in the updated Lagrangian formulation. This research proposes a relative nodal displacement method to represent the position and orientation for a node in truss structures. Since the proposed method measures the relative nodal displacements relative to its adjacent nodal reference frame, they are still small for a truss structure undergoing large deformations for the small size elements. As a consequence, element formulations developed under the small deformation assumption are still valid fer structures undergoing large deformations, which significantly simplifies the equations of equilibrium. A structural system is represented by a graph to systematically develop the governing equations of equilibrium for general systems. A node and an element are represented by a node and an edge in graph representation, respectively. Closed loops are opened to form a spanning tree by cutting edges. Two computational sequences are defined in the graph representation. One is the forward path sequence that is used to recover the Cartesian nodal displacements from relative nodal displacements and traverses a graph from the base node towards the terminal nodes. The other is the backward path sequence that is used to recover the nodal forces in the relative coordinate system from the known nodal forces in the absolute coordinate system and traverses from the terminal nodes towards the base node. One closed loop structure undergoing large deformations is analyzed to demonstrate the efficiency and validity of the proposed method.

• Bulletin of the Korean Mathematical Society
• /
• v.52 no.2
• /
• pp.467-481
• /
• 2015

Choi and Park introduced an invariant of a finite simple graph, called signed a-number, arising from computing certain topological invariants of some specific kinds of real toric manifolds. They also found the signed a-numbers of path graphs, cycle graphs, complete graphs, and star graphs. We introduce a signed a-polynomial which is a generalization of the signed a-number and gives a-, b-, and c-numbers. The signed a-polynomial of a graph G is related to the $Poincar\acute{e}$ polynomial $P_{M(G)}(z)$, which is the generating function for the Betti numbers of the real toric manifold M(G). We give the generating functions for the signed a-polynomials of not only path graphs, cycle graphs, complete graphs, and star graphs, but also complete bipartite graphs and complete multipartite graphs. As a consequence, we find the Euler characteristic number and the Betti numbers of the real toric manifold M(G) for complete multipartite graphs G.

• Journal of applied mathematics & informatics
• /
• v.20 no.1_2
• /
• pp.209-224
• /
• 2006

This paper presents an optimization model with performance constraints for two kinds of graph elements layout problem. The layout problem is partitioned into finite subproblems by using graph theory and group theory, such that each subproblem overcomes its on-off nature about optimal variable. Furthermore each subproblem is relaxed and the continuity about optimal variable doesn't change. We construct a min-max problem which is locally equivalent to the relaxed subproblem and develop the first order necessary and sufficient conditions for the relaxed subproblem by virtue of the min-max problem and the theories of convex analysis and nonsmooth optimization. The global optimal solution can be obtained through the first order optimality conditions.

• Proceedings of the Korea Concrete Institute Conference
• /
• 1996.04a
• /
• pp.270-274
• /
• 1996

Until recently pre & post-processing of finite element model has been heavily relied on expensive graphic peripheral devices. But today, with the aid of inexpensive microcomputers, very effective pre & postprocessor graphics has been developed. In this study, Pre & Post processor(MASSPRE, MASSPOST) of prediction analysis of thermal stress in mass concrete structure is developed. The developed pre & post processors are raise to the efficiency in making input data for the main program and analysis of the results produced by the main program. This MASSPOST presents a stress contour graph, volume slice, time-temperature history graph, time-stress history graph, etc.

• Bulletin of the Korean Mathematical Society
• /
• v.52 no.6
• /
• pp.2025-2034
• /
• 2015

In this paper, we characterize some PGL(2, q) by their orders and maximum element orders. We also prove that PSL(2, p) with $p{\geqslant}3$ a prime can be determined by their orders and maximum element orders. Moreover, we show that, in general, if $q=p^n$ with p a prime and n > 1, PGL(2, q) can not be uniquely determined by their orders and maximum element orders. Several known results are generalized.

• Journal of Electrical Engineering and information Science
• /
• v.2 no.6
• /
• pp.43-47
• /
• 1997

A procedure presented in this paper generates test sequences to check the conformity of an implementation with a protocol specification, which is modeled as a deterministic finite state machine (FSM). Given a FSM, a common procedure of test sequence generation, first, constructs a directed graph which edges include the state check after each transition, and produces a symmetric graph G* from and, finally, finds a Euler tour of G*. We propose a technique to determine a minimum-cost tour of the transition graph of the FSM. The proposed technique using Multiple Unique State Signature (MUSS) solves an open issue that one MUIO sequence assignment may lead to two more edges of unit cost being replicated to from G* while an optimal assignment may lead to the replication of a single edge of high cost. In this paper, randomly generated FSMs have been studied as test cases. The result shows that the proposed technique saves the cost 4∼28% and 2∼21% over the previous approach using MUIO and MUSP, respectively.

• Bulletin of the Korean Mathematical Society
• /
• v.61 no.3
• /
• pp.763-777
• /
• 2024

Let R be a commutative ring with identity 1≠ 0. In this paper, we continue the study started in [10] to further investigate when the extended zero-divisor graph of R, denoted as $\bar{\Gamma}$(R), is complemented. We also study when $\bar{\Gamma}$(R) is uniquely complemented. We give a complete characterization of when $\bar{\Gamma}$(R) of a finite ring R is complemented. Various examples are given using the direct product of rings and idealizations of modules.