• Journal of applied mathematics & informatics
• /
• v.41 no.4
• /
• pp.741-752
• /
• 2023

A new variant of vertex edge domination, namely semi total vertex edge domination has been introduced in the present paper. A subset S of the vertex set V of a graph G is said to be a semi total vertex edge dominating set(stved - set), if it is a vertex edge dominating set of G and each vertex in S is within a distance two of another vertex in S. An stved-set of G having minimum cardinality is said to be an γ_stve(G)- set and its cardinality is denoted by γ_stve(G). Bounds for γ_stve(G) - set have been given in terms of various graph theoretic parameters and graphs attaining the bounds have been characterized. In particular, bounds for trees have been obtained and extremal trees have been characterized.

• Journal of the Society of Naval Architects of Korea
• /
• v.59 no.6
• /
• pp.393-399
• /
• 2022

During the ship hull design process, resistance performance estimation is generally calculated by simulation using computational fluid dynamics. Since such hull resistance performance simulation requires a lot of time and computation resources, the time taken for simulation is reduced by CPU clusters having more than tens of cores in order to complete the hull design within the required deadline of the ship owner. In this paper, we propose a method for estimating resistance performance of ship hull by simulation using a graph neural network. This method converts the 3D geometric information of the hull mesh and the physical quantity of the surface into a mathematical graph, and is implemented as a deep learning model that predicts the future simulation state from the input state. The method proposed in the resistance performance experiment of simple hull showed an average error of about 3.5 % throughout the simulation.

• Communications of the Korean Mathematical Society
• /
• v.28 no.4
• /
• pp.857-863
• /
• 2013

In this paper, we prove that the total domination number of a $P_6$-free graph of order $n{\geq}3$ and minimum degree at least one which is not the cycle of length 6 is at most $\frac{n+1}{2}$, and the bound is sharp.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.11
• /
• pp.2823-2834
• /
• 1998

This paper deals with the problem of one-to-one mapping of $2^n$ task modules of a parallel program to an n-dimensional hypercube multicomputer so as to minimize to total communication cost during the execution of the task. The problem of finding an optimal mapping has been proven to be NP-complete. We first propose a graph modification technique which transfers the mapping problem in a hypercube multicomputer into the problem of finding a set of maximum cutsets on a given task graph. Using the graph modification technique, we then propose a repeated mapping scheme which efficiently finds a one-to-one mapping of task modules to a hypercube multicomputer by repeatedly applying an existing bipartitioning algorithm on the modified graph. The repeated mapping scheme is shown to be highly effective on a number of test task graphs, it increasingly outperforms the greedy and recursive mapping algorithms as the number of processors increase. The proposed algorithm is shown to be very effective for regular graph, such as hypercube-isomorphic or 'almost' isomorphic graphs and meshes; it finds optimal mapping on almost all the regular task graphs considered.

• Journal of the Korean earth science society
• /
• v.40 no.6
• /
• pp.639-653
• /
• 2019

The purpose of this study is to investigate the science gifted students' level of interpreting the oceanic graph and of understanding the oceanic physical concept through analyzing the Temperature-Salinity (T-S) diagram and inferring the SOFAR (SOund Fixing And Ranging) channel. A total of 106 gifted students in the 3rd year of a science gifted high school, using T-S diagrams published in one of the journals of Oceanology, developed descriptive questions asking the depth of the SOFAR channel to conduct the quantitative and qualitative analysis of graph interpretation ability. As a result, there was a big difference in the level of graphs interpretation and concepts understanding for each science gifted students such as interpreting, modeling, and converting, and exposed their alternative concepts about water temperature, salinity, and density. The results of this study will be used to understand the levels of science gifted students' graph interpretation in oceanology, and to provide the basic data for improving the teaching and learning methods of oceanology and also provide basic data for teaching material development related to graph analysis.

• Journal of KIISE:Databases
• /
• v.32 no.5
• /
• pp.498-508
• /
• 2005

A shape data is used one oi most important feature for image retrieval as data to reflect meaning of image. Especially, structural feature of shape is widely studied because it represents primitive properties of shape and relation information between basic units well. However, most structural features of shape have the problem that it is not able to guarantee an efficient search time because the features are expressed as graph or tree. In order to solve this problem, we generate curvature-based morphological graph, End design key to cluster shapes from this graph. Proposed this graph have contour features and morphological features of a shape. Shape retrieval is accomplished by stages. We reduce a search space through clustering, and determine total similarity value through pattern matching of external curvature. Various experiments show that our approach reduces computational complexity and retrieval cost.

• Korean Institute of Interior Design Journal
• /
• v.19 no.4
• /
• pp.74-81
• /
• 2010

This study analyzed characteristics of visual circulation in the modern museum architecture while carrying out space syntax and visibility graph analysis side by side in order to solve problems of visitors' movement having been suggested as the point at issue at modern museum architecture that has become big scaled and layering so as to satisfy various social demands. Also, the result of this analysis is same as followings. First, visitors become to watch the exhibition with clear position that can make themselves in right allocation, and thus visual and perceptual confusions were shown as relatively low in case physical position and visual one were matched at major space of atrium type or mediation space. Second, it was appeared a lot at the museum having exhibition space of room type in case the physical position and visual one were not matched. Visual circulation in the exhibition space of room type has a merit of forming the circulation where free selection is possible. However, it have raised concerns that visual passageway of visitors could be in a stalemate or crash at the opening part, not at the exhibition hall. Third, though analysis of space syntax had a merit of analyzing total modern museum architectures having became compounded and big scaled, but it was dropped in reliability from the visual circulation's analysis that was decided by flows of space and time. In contrary, visibility graph analysis was shown as having a merit to analyzing the flows rather than that of total structure, and also appeared as being able to supplement the disadvantage of space syntax in methodology. Upon the above analysis, a lot of architectural elements such as allocation of exhibition hall, location of door and window etc. were appeared as affecting influences to forming visual circulation of visitors, not to mention of allocations of major space, mediation space, and exhibition one. Through this study, various possibilities of quantitative analysis on the visual circulation in the museum architectures can be confirmed. However, this study expects that in-depth subsequent researches objecting to various museums could be realized afterwards because there are still limitations in its analysis.

• Korean Journal of Veterinary Service
• /
• v.24 no.3
• /
• pp.279-285
• /
• 2001

The change of the body condition score(BCS) and milk production graph as days in milk by lactation number show that the productivity of cow is on the increase as increase the lactation number, but the health condition is much worse because of the inappropriate nutrition intake. Metabolic profiles test(MPT) results indicate that the early-lactation for directly after the parturition to the peak production of milk during the total lactation period is the time of the more likely to be exposed to lack of energy, protein, minerals. To solve this problem, the early-lactation cows should be sufficiently supplied the required nutrients and should maximum intake the supplied nutrients not to be suddenly decline body weight and BCS from postparturition to the peak production of milk. To maximize the dry matter intake of a cow, there is have got to improve the management of body weight for heifer's skeletal development and in the dry period which is carelessly deal by mostly farms. This study presents that the use of measurement of body weight, graph of body condition score, distribution of milk production, metabolic profiles test in the monitoring for dairy herd health management is very valuable.

• Journal of the Economic Geographical Society of Korea
• /
• v.15 no.3
• /
• pp.343-357
• /
• 2012

The Seoul metropolitan subway system can be represented by a graph which consists of nodes and edges. In this paper, we study classification of subway stations and trip behaviour of subway passengers through partitioning the graph of the subway system into roughly equal groups. A weight of each edge of the graph is set to the number of passengers who pass the edge, where the number of passengers is extracted from the transportation card transaction database. Since the graph partitioning problem is NP-complete, we propose a heuristic algorithm to partition the subway graph. The heuristic algorithm uses one of two alternative objective functions, one of which is to minimize the sum of weights of edges connecting nodes in different groups and the other is to maximize the ratio of passengers who get on the subway train at one subway station and get off at another subway station in the same group to the total subway passengers. In the experimental results, we illustrate the subway stations and edges in each group by color on a map and analyze the trip behaviour of subway passengers by the group origin-destination matrix.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1375-1377
• /
• 2002

New graph coloring problems are discussed as models of a multihop network in this report. We consider a total scheduling problem, and prove that this problem is NP-hard. We propose new scheduling models of a multi-hop network for CDMA system, and show the complexity results of the scheduling problems.