• Journal of applied mathematics & informatics
• /
• v.42 no.1
• /
• pp.159-167
• /
• 2024

The Topological indices are known as Mathematical characterization of molecules. In this paper, we have studied line graph of subdivision and semi-total point graph of triangular benzenoid, polynomino chains of 8-cycles and graphene sheet through forgotten and first Zagreb indices.

• Korean Journal of Mathematics
• /
• v.31 no.4
• /
• pp.505-519
• /
• 2023

Let G = (V, E) be a graph. A subset S of V is called a dominating set of G if every vertex not in S is adjacent to some vertex in S. The domination number γ(G) of G is the minimum cardinality taken over all dominating sets of G. A dominating set S is called a connected dominating set if the subgraph induced by S is connected. The minimum cardinality taken over all connected dominating sets of G is called the connected domination number of G, and is denoted by γ_c(G). In this paper, we investigate the Nordhaus-Gaddum type results for the connected domination number and its derived graphs like line graph, subdivision graph, power graph, block graph and total graph, and characterize the extremal graphs.

• Journal of Applied and Pure Mathematics
• /
• v.4 no.5_6
• /
• pp.317-329
• /
• 2022

In this paper we investigate the pair difference cordial labeling behaviour of m- copies of K₄, subdivision of star, fan, comb graphs.

• Journal of applied mathematics & informatics
• /
• v.38 no.3_4
• /
• pp.221-238
• /
• 2020

Let G = (V (G), E(G)) be a graph and let g : V (G) → S₃ be a function. For each edge xy assign the label r where r is the remainder when o(g(x)) is divided by o(g(y)) or o(g(y)) is divided by o(g(x)) according as o(g(x)) ≥ o(g(y)) or o(g(y)) ≥ o(g(x)). The function g is called a group S₃ cordial remainder labeling of G if |v_g(i)-v_g(j)| ≤ 1 and |e_g(1)-e_g(0)| ≤ 1, where v_g(j) denotes the number of vertices labeled with j and e_g(i) denotes the number of edges labeled with i (i = 0, 1). A graph G which admits a group S₃ cordial remainder labeling is called a group S₃ cordial remainder graph. In this paper, we prove that subdivision of graphs admit a group S₃ cordial remainder labeling.

• Journal of applied mathematics & informatics
• /
• v.42 no.1
• /
• pp.1-14
• /
• 2024

Let G = (V, E) be a (p, q) graph. Define $$\begin{cases}\frac{p}{2},\:if\:p\:is\:even\\\frac{p-1}{2},\:if\:p\:is\:odd\end{cases}$$ and L = {±1, ±2, ±3, ···, ±ρ} called the set of labels. Consider a mapping f : V → L by assigning different labels in L to the different elements of V when p is even and different labels in L to p - 1 elements of V and repeating a label for the remaining one vertex when p is odd.The labeling as defined above is said to be a pair difference cordial labeling if for each edge uv of G there exists a labeling |f(u) - f(v)| such that |Δ_f1 - Δ_f^c1| ≤ 1, where Δ_f1 and Δ_f^c1 respectively denote the number of edges labeled with 1 and number of edges not labeled with 1. A graph G for which there exists a pair difference cordial labeling is called a pair difference cordial graph. In this paper we investigate the pair difference cordial labeling behavior of subdivision of some graphs.

• KIEAE Journal
• /
• v.10 no.3
• /
• pp.57-62
• /
• 2010

To effectively use Building Information Modelling (BIM) dealing with semantic information including the entities of building components, the information about building components should be standardized. Like standardized modern buildings. in the past, Korean traditional houses were built according to strict procedures and formats. Therefore, if the Korean traditional house are modelled by using BIM,. not only the Korean traditional house of good quality will be built quickly and cheaply, but also spaces in the existing Korean traditional house will be easily analyzed. However, when analyzing spaces of the Korean traditional house using Space Syntax, some problems are caused in dividing outdoor space such as yard with unclear boundaries, unlike indoor space with clear boundaries surrounded by walls. These comes from the fact that researchers have subjectively divided a space in the house into convex spaces as units for Space Syntax analysis. Therefore, this study aims to develop an objective and rational spatial subdivision technique for Space Syntax analysis of a Korean traditional house modelled by using BIM. We could objectively and reasonably divide a Korean traditional house space into convex spaces by recognizing the building components in the house modelled in the form of Industry Foundation Classes(IFC). Depending on the connection of convex spaces allocated in the spatial subdivision technique, j-graph in Space Syntax could be drawn and the measurements of spatial configurations could be determinded. Through the developed technique, the social properties including the cultural and philosophical aspects of Korean people was identified by measuring the spatial configurations of Korean traditional house. The developed technique will serve as useful means to help architects to find an appropriate purpose of each space for sustainable architecture on the basis of the spatial and social relationships in buildings or urban systems.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.8
• /
• pp.2061-2074
• /
• 1998

In pattern recognition and image analysis upplications, a graph is a useful tool for complex obect representation and recognition. However it takes much time to pair proper nodes between the prototype graph and an input data graph. Futhermore it is difficult to decide whether the two graphs in a class are the same hecause real images are degradd in general by noise and other distortions. In this paper we propose a matching algorithm using a matrix. The matrix is suiable for simple and easily understood representation and enables the ordering and matching process to be convenient due to its predefined matrix manipulation. The nodes which constitute a gaph are ordered in the matrix by their geometrical positions and this makes it possible to save much comparison time for finding proper node pairs. for the classification, we defined a distance measure thatreflects the symbo's structural aspect that is the sum of the mode distance and the relation distance; the fornet is from the parameters describing the node shapes, the latter from the relations with othes node in the matrix. We also introduced a subdivision operation to compensate node merging which is mainly due t the prepreocessing error. The proposed method is applied to the recognition of musteal symbols and the result is given. The result shows that almost all, except heavily degraded symbols are recognized, and the recognition rate is approximately 95 percent.

• Journal of KIISE:Databases
• /
• v.28 no.4
• /
• pp.587-595
• /
• 2001

Precomputation and materialization of parts. commonly called views of a data cube is a common technique in data warehouses The view is defined as the result of a query which is defined through aggregate functions In this paper we introduce the concept of fine granule view. The fine granule view is the result of a query defined through aggregate functions and the range on each dimension, where the subdivision of each dimension is based on queries access patterns. For the representation and selection of fine granule views to materialize, we define the ANO-OR cube graph and AND-OR minimum cost graph. With these structures, we propose a fine granule view materialization method. And through experiments, we evaluate the performance of the proposed method.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.4 no.4
• /
• pp.250-257
• /
• 2011

This experiment present the automatic detection algorithm of gastric cancer that take second place among all cancers. If an inflammation and a cancer are not examined carefully, early ones have difficulty in being diagnosed as illnesses than advanced ones. For diagnosis of gastric cancer, and progressing cancer in this study, present 4 algorithm. research team extracted an abnormal part in stomach through the endoscope image. At first, decide to use shading technique or not in each endoscope image for study. it make easy distinguish to whether tumor is existing or not by putting shading technique in or eliminate it by the color. Second. By passing image subjoin shading technique to erosion filter, eliminate noise and make give attention to diagnose. Third. Analyzing out a line and fillet graph from image adding surface shade and detect RED value according to degree of symptoms. Fourth. By suggesting this algorithm, that making each patient's endscope image into subdivision graph including RED graph value, afterward revers the color, revealing the position of tumor, this study desire to help to diagnosing gastric, other cancer and inflammation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.2
• /
• pp.401-407
• /
• 2016

We can consider the following problems for two given points p and q in a simple polygon P. (1) Compute the set of points of P which are visible from both p and q. (2) Compute the set of points of P which are visible from either p or q. They are corresponding to the problems which are to compute the intersection and the union of two visibility polygons. In this paper, we consider algorithms for solving these problems on a reconfigurable mesh(in short, RMESH). The algorithm in [1] can compute the intersection of two general polygons in constant time on an RMESH with size O($n^3$), where n is the total number of vertices of two polygons. In this paper, we construct the planar subdivision graph in constant time on an RMESH with size O($n^2$) using the properties of the visibility polygon for preprocessing. Then we present O($log^2n$) time algorithms for computing the union as well as the intersection of two visibility polygons, which improve the processor-time product from O($n^3$) to O($n^2log^2n$).