• Journal of the Speleological Society of Korea
• /
• no.86
• /
• pp.8-15
• /
• 2008

This study is about the efficiency of graph theory that can be applied as the research analysis method in order to identify the relational location features of the caves favored as the ecological tourists attraction. Creating network with traffic nodes and surrounding tourists attractions in a certain space including the caves as the tourists attraction and structural analysis on the overall network using various kinds of index will be very useful method to identify the relational location features and benefits from linking the caves as the tourists attractions. In particular, it can be applied to set the spatial scope in the tourism development plan including the caves as the tourists attractions.

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

• The Journal of Society for e-Business Studies
• /
• v.20 no.2
• /
• pp.155-166
• /
• 2015

RWR (Random Walk with Restart) is frequently used by many graph-based ranking algorithms, but it does not consider a signed graph where edges may have negative weight values. In this paper, we apply the Balance Theory by F. Heider to RWR over a signed graph and propose a novel RWR, Balanced Random Walk (BRW). We apply the proposed technique into the domain of recommendation system, and show by experiments its effectiveness to filter out the items that users may dislike. In order to provide the reasonable performance of BRW in the domain, we modify the existing Top-k algorithm, BCA, and propose a new algorithm, Bicolor-BCA. The proposed algorithm yet requires employing a threshold. In the experiment, we show how threshold values affect both precision and performance of the algorithm.

• Journal for History of Mathematics
• /
• v.19 no.2
• /
• pp.125-140
• /
• 2006

In 1933, I. Schur introduced a Schur ring in connection with permutation group and regular subgroup. After then, it was studied mostly for purely group theoretical purposes. In 1970s, Klin and Poschel initiated its usage in the investigation of graphs, especially for Cayley and circulant graphs. Nowadays it is known that Schur ring is one of the best way to enumerate Cayley graphs. In this paper we study the origin of Schur ring back to 1933 and keep trace its evolution to graph theory and combinatorics.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.1
• /
• pp.211-230
• /
• 2022

In image segmentation, for the condition that objects (targets) and background in an image are intertwined or their common boundaries are vague as well as their textures are similar, and the targets in images are greatly variable, the deep learning might be difficult to use. Hence, a new method based on graph theory and guided feathering is proposed. First, it uses a guided feathering algorithm to initially separate the objects from background roughly, then, the image is separated into two different images: foreground image and background image, subsequently, the two images are segmented accurately by using the improved graph-based algorithm respectively, and finally, the two segmented images are merged together as the final segmentation result. For the graph-based new algorithm, it is improved based on MST in three main aspects: (1) the differences between the functions of intra-regional and inter-regional; (2) the function of edge weight; and (3) re-merge mechanism after segmentation in graph mapping. Compared to the traditional algorithms such as region merging, ordinary MST and thresholding, the studied algorithm has the better segmentation accuracy and effect, therefore it has the significant superiority.

• International conference on construction engineering and project management
• /
• 2005.10a
• /
• pp.383-388
• /
• 2005

In the construction industry, complex works are carried out with significant resources under non-linear circumstances where clear concepts of project management could be of benefit to all parties and personnel involved. In this paper, we define the optimum project management configuration for construction management by using DSM (Design Structure Matrix). Furthermore DSM can be visualized as a network model, and then Graph Theory provides us the numerical results.

• Journal of applied mathematics & informatics
• /
• v.31 no.5_6
• /
• pp.595-608
• /
• 2013

Let G = (V, E) be a simple connected graph. The sets of vertices and edges of G are denoted by V = V (G) and E = E(G), respectively. In such a simple molecular graph, vertices represent atoms and edges represent bonds. The distance between the vertices $u$ and $v$ in V (G) of graph G is the number of edges in a shortest path connecting them, we denote by $d(u,v)$. In graph theory, we have many invariant polynomials for a graph G. In this paper, we focus on the Schultz polynomial, Modified Schultz polynomial, Hosoya polynomial and their topological indices of a molecular graph circumcoronene series of benzenoid $H_k$ and specially third member from this family. $H_3$ is a basic member from the circumcoronene series of benzenoid and its conclusions are base calculations for the Schultz polynomial and Hosoya polynomial of the circumcoronene series of benzenoid $H_k$ ($k{\geq}3$).

• Proceedings of the Korean Society of Tribologists and Lubrication Engineers Conference
• /
• 2002.10b
• /
• pp.459-460
• /
• 2002

This article discusses a diagnostics method based on models, and information theory. From an extensive system dynamics bond graph model of a gearbox [1], simulated were various cases germane to this diagnostics approach, including the response of an ideal gearbox, which functions perfectly to designer's specifications, and degraded gearboxes with tooth root cracking. By comparing these cases and constructing a signal flow analogy between the gearbox and a communication channel, Shannon' s information theory [2], including theorems, was applied to the gearbox to assess system health, in terms of ability to function.

• Journal of Korea Water Resources Association
• /
• v.31 no.4
• /
• pp.439-448
• /
• 1998

There are many methods to calculate steady-state flowrate in a large water distribution system. Linear method which analyzes continuity equations and energy equations simultaneously is most widely used. Though it is theoretically simple, when it is applied to a practical water distribution system, it produces a very sparse coefficient matrix and most of its diagonal elements are to be zero. This sparsity characteristic of coefficient matrix makes it difficult to analyze pipe flow using the linear method. In this study, a graph theory is introduced to water distribution system analysis in order to prevent from producing ill-conditioned coefficient matrix and the technique is developed to produce positive-definite matrix. To test applicability of developed method, this method is applied to 22 pipes and 142 pipes system located nearby Taegu city. The results obtained from these applications show that the method can calculate flowrate effectively without failure in converage. Thus it is expected that the method can analyze steady state flowrate and pressure in pipe network systems efficiently. Keywords : pipe flow analysis, graph theory, linear method.

• Bulletin of the Korean Mathematical Society
• /
• v.57 no.3
• /
• pp.739-750
• /
• 2020

A simple graph is called semisymmetric if it is regular and edge transitive but not vertex transitive. Let p be a prime. Folkman proved [J. Folkman, Regular line-symmetric graphs, Journal of Combinatorial Theory 3 (1967), no. 3, 215-232] that no semisymmetric graph of order 2p or 2p² exists. In this paper an extension of his result in the case of cubic graphs of order 34p³, p ≠ 17, is obtained.