• Bulletin of the Korean Mathematical Society
• /
• v.51 no.4
• /
• pp.1145-1153
• /
• 2014

Let G be a finite group and X be a union of conjugacy classes of G. Define C(G,X) to be the graph with vertex set X and $x,y{\in}X$ ($x{\neq}y$) joined by an edge whenever they commute. In the case that X = G, this graph is named commuting graph of G, denoted by ${\Delta}(G)$. The aim of this paper is to study the automorphism group of the commuting graph. It is proved that Aut(${\Delta}(G)$) is abelian if and only if ${\mid}G{\mid}{\leq}2$; ${\mid}Aut({\Delta}(G)){\mid}$ is of prime power if and only if ${\mid}G{\mid}{\leq}2$, and ${\mid}Aut({\Delta}(G)){\mid}$ is square-free if and only if ${\mid}G{\mid}{\leq}3$. Some new graphs that are useful in studying the automorphism group of ${\Delta}(G)$ are presented and their main properties are investigated.

• Journal of KIISE:Databases
• /
• v.29 no.5
• /
• pp.347-357
• /
• 2002

Graphs have provided a powerful methodology to solve a lot of real-world problems, and therefore there have been many proposals on the graph representations and algorithms. But, because most of them considered only memory-based graphs, there are still difficulties to apply them to large-scale problems. To cope with the difficulties, this paper proposes a graph representation and graph algorithms based on the well-developed relational database theory. Graphs are represented in the form of relations which can be visualized as relational tables. Each vertex and edge of a graph is represented as a tuple in the tables. Graph algorithms are also defined in terms of relational algebraic operations such as projection, selection, and join. They can be implemented with the database language such as SQL. We also developed a library of basic graph operations for the management of graphs and the development of graph applications. This database approach provides an efficient methodology to deal with very large- scale graphs, and the graph library supports the development of graph applications. Furthermore, it has many advantages such as the concurrent graph sharing among users by virtue of the capability of database.

• Journal of applied mathematics & informatics
• /
• v.33 no.5_6
• /
• pp.545-557
• /
• 2015

A vague graph is a generalized structure of a fuzzy graph that gives more precision, flexibility and compatibility to a system when compared with systems that are designed using fuzzy graphs. In this paper, we define two new operation on vague graphs namely normal product and tensor product and study about the degree of a vertex in vague graphs which are obtained from two given vague graphs G₁ and G₂ using the operations cartesian product, composition, tensor product and normal product. These operations are highly utilized by computer science, geometry, algebra, number theory and operation research. In addition to the existing operations these properties will also be helpful to study large vague graph as a combination of small, vague graphs and to derive its properties from those of the smaller ones.

• Journal of Advanced Marine Engineering and Technology
• /
• v.39 no.2
• /
• pp.159-165
• /
• 2015

Motion control schemes are generally classified into three categories (point stabilization, trajectory tracking, and path following). This paper deals with the problem which is associated with the initial deployment of a group of Unmanned Surface Vehicle (USVs) and corresponding point stabilization. To keep the formation of a group of USVs, it is necessary to set the relationship between each vehicle. A forcing functions such as potential fields are designed to keep the formation and a graph Laplacian is used to represent the connectivity between vehicle. In case of fixed topology of the graph representing the communication between the vehicles, the graph Laplacian is assumed constant. However the graph topologies are allowed to change as the vehicles move, and the system dynamics become discontinuous in nature because the graph Laplacian changes as time passes. To check the stability in the stage of deployment, the system is modeled with Kronecker algebra notation. Filippov's calculus of differential equations with discontinuous right hand sides is then used to formally characterize the behavior of USVs. The stability of the system is analyzed with Lyapunov's stability theory and LaSalle's invariance principle, and the validity is shown by checking the variation of state norm.

• Journal of KIISE
• /
• v.43 no.5
• /
• pp.541-552
• /
• 2016

This paper introduces the new notions of conjunctive and complement choices in process algebra, which reduce both process and system complexities significantly for distributed mobile real-time system during specification and analysis phases. The complement choice implies that two processes make cohesive choices for their synchronous partners at their own choice operations. The conjunctive choice implies choice dependency among consecutive choice operations in a process. The conjunctive choice reduces process complexity exponentially by the degree of the consecutive choice operations. The complement choice also reduces system complexity exponentially by the degree of the synchronous choice operations. Consequently, the reduction method makes the specification and analysis of the systems much easier since the complexity is reduced significantly. This notion is implemented in a process algebra, called ${\delta}$-Calculus. The efficiency and effectiveness are demonstrated with an example in a tool for the algebra, called SAVE, which is developed on ADOxx platform.

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.6
• /
• pp.608-619
• /
• 2000

In this paper, we give a formal semantics for Statechart via a translation into Algebra of Communicating Shared Hesources(ACSR). Statechart is a very rich graphical specification language, which is suitable to specify complicated reactive systems. However, the incorporation of graph into specification and rich syntax makes Statechart semantics very complicated and ambiguous. Thus, it is very difficult to verify the correctness of Statechart specifications. Also, we propose the formal verification method for Statechart specifications by showing equivalence relation between two Statechart specifications. This makes it possible to combine the advantages of a graphical language with the rigor of process algebra.

• The Journal of Korean Institute for Practical Engineering Education
• /
• v.2 no.2
• /
• pp.49-54
• /
• 2010

The functions and their graphs are very important parts in mathematical educations. But there seems be a lot of students studying the functions and their graphs without grasping the meaning of them and without interest with them. We present a learning method of how to match functions and their graphs with outlines of various shapes. That is, outlines of the shapes are assumed to be the graphs of the functions and the graphs will be plotted on the screen of a computer with help of the computer algebra system.

• Journal of Educational Research in Mathematics
• /
• v.8 no.2
• /
• pp.541-551
• /
• 1998

Recently, the importance of participating in classes activity and cultivating student's thinking ability is emphasized in the mathematics education society. Teachers are demanded to change their teaching style centered pencile-and paper into using the variety instructional aids, such as calculator, video tape, computer, ohp, and projector, etc. In this paper, we search for the mathematica's function and the method that apply mathematical to the secondary school mathematics. Mathematical has many functions: calculator, algebra, graphics, animations, programing, notebook. We find that mathematica can be applied to the graph of function, the understand of simultaneous equations, the graph of trigonometry function, the calculation of limit, the computation of areas as limits, the derivative of a function and tangent line, a solid figure, and others in secondary school mathematics.

• Bulletin of the Korean Mathematical Society
• /
• v.52 no.4
• /
• pp.1201-1211
• /
• 2015

s-sequences and d-sequences are fundamental sequences intensively studied in many fields of algebra. In this paper we are interested in dealing with monomial sequences associated to graphs in order to establish conditions for which they are s-sequences and/or d-sequences.

• Communications of the Korean Mathematical Society
• /
• v.32 no.1
• /
• pp.7-17
• /
• 2017

Let R be a commutative ring with zero-divisors Z(R). The extended zero-divisor graph of R, denoted by $\bar{\Gamma}(R)$, is the (simple) graph with vertices $Z(R)^*=Z(R){\backslash}\{0\}$, the set of nonzero zero-divisors of R, where two distinct nonzero zero-divisors x and y are adjacent whenever there exist two non-negative integers n and m such that $x^ny^m=0$ with $x^n{\neq}0$ and $y^m{\neq}0$. In this paper, we consider the extended zero-divisor graphs of idealizations $R{\ltimes}M$ (where M is an R-module). At first, we distinguish when $\bar{\Gamma}(R{\ltimes}M)$ and the classical zero-divisor graph ${\Gamma}(R{\ltimes}M)$ coincide. Various examples in this context are given. Among other things, the diameter and the girth of $\bar{\Gamma}(R{\ltimes}M)$ are also studied.