• Bulletin of the Korean Mathematical Society
• /
• v.50 no.5
• /
• pp.1753-1763
• /
• 2013

In this paper, we show that tree products of certain subgroup separable groups amalgamating normal subgroups are cyclic subgroup separable. We then extend this result to certain graph product of certain subgroup separable groups amalgamating normal subgroups, that is we show that if the graph has exactly one cycle and the cycle is of length at least four, then the graph product is cyclic subgroup separable.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.05a
• /
• pp.718-721
• /
• 2004

This paper introduces a novel method of partitioning a cyclic workflow graph into the subgraphs of acyclic flows. The way of iterative classification of nodes according to feedback structures and deriving subgraphs of acyclic flows is described with illustrative examples. The proposed method allows a cyclic workflow model to be analyzed further, if necessary, with several smaller subflows, which are all acyclic.

• Journal of applied mathematics & informatics
• /
• v.41 no.2
• /
• pp.287-293
• /
• 2023

In this paper, the Augmented graph Es(τ) of the inverse graph Gs(τ) of a cyclic group (τ,◦) was studied. The Augmented inverse graph was constructed by applying the method of Mycielski's construction. The dimension of Augmented inverse graph and different properties of the graph were investigated. Later the chromatic number of Augmented inverse graph was discussed and the relation between the maximum degree of the graph and the chromatic number was established. In the Mycielski's construction, the properties of the key node 'u' in Es (τ) were established based on cardinality of the cyclic group (τ,◦) and also proved that the Augmented inverse graph Es(τ) was a triangle free graph.

• Journal of applied mathematics & informatics
• /
• v.24 no.1_2
• /
• pp.261-271
• /
• 2007

The symbol C($m_1^{n_1}m_2^{n_2}{\cdots}m_s^{n_s}$) denotes a 2-regular graph consisting of $n_i$ cycles of length $m_i,\;i=1,\;2,\;{\cdots},\;s$. In this paper, we give some construction methods of cyclic($K_v$, G)-designs, and prove that there exists a cyclic($K_v$, G)-design when $G=C((4m_1)^{n_1}(4m_2)^{n_2}{\cdots}(4m_s)^{n_s}\;and\;v{\equiv}1(mod\;2|G|)$.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.10a
• /
• pp.161-164
• /
• 2000

A cyclic shop is a production system that repeatedly produces identical sets of jobs, called minimal part sets, in the same loading and processing sequence. We consider a version of cyclic shop where the operations are processed and unloaded within time limits, so called a time window. We model the shop using an event graph model, a class of Petri nets. To represent the time window constraint, we introduce places with negative time delays. From the shop modeling graph, we develop a linear system model based on the max- plus algebra and characterize the conditions on the existence of a stable schedule.

• Korean Journal of Mathematics
• /
• v.21 no.1
• /
• pp.55-62
• /
• 2013

The base $l(S)$ of a signed digraph S is the maximum number $k$ such that for any vertices $u$, $v$ of S, there is a pair of walks of length $k$ from $u$ to $v$ with different signs. A graph can be regarded as a digraph if we consider its edges as two-sided arcs. A signed cyclic graph $\tilde{C_n}$ is a signed digraph obtained from the cycle $C_n$ by giving signs to all arcs. In this paper, we compute the base of a signed cyclic graph $\tilde{C_n}$ when $\tilde{C_n}$ is neither symmetric nor antisymmetric. Combining with previous results, the base of all signed cyclic graphs are obtained.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.12
• /
• pp.33-41
• /
• 2011

From Complicated graph structures, duplicated operations can be executed and the operations give low efficiency. In this paper, we propose an efficient graph mining algorithm of minimizing the extension of duplicated graph patterns in which the priorities of cyclic edges are considered. In our approach, the cyclic edges with lower priorities are first extended and so duplicated extensions can be reduced. For performance test, we implement our algorithm and compare our algorithm with a state of the art, Gaston algorithm. Finally, We show that ours outperforms Gaston algorithm.

• ETRI Journal
• /
• v.29 no.3
• /
• pp.381-389
• /
• 2007

In this paper we propose a graph-theoretic method based on linear congruence for constructing low-density parity check (LDPC) codes. In this method, we design a connection graph with three kinds of special paths to ensure that the Tanner graph of the parity check matrix mapped from the connection graph is without short cycles. The new construction method results in a class of (3, ${\rho}$)-regular quasi-cyclic LDPC codes with a girth of 12. Based on the structure of the parity check matrix, the lower bound on the minimum distance of the codes is found. The simulation studies of several proposed LDPC codes demonstrate powerful bit-error-rate performance with iterative decoding in additive white Gaussian noise channels.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.9
• /
• pp.3258-3273
• /
• 2021

Malware is a severe threat to the computing system and there's a long history of the battle between malware detection and anti-detection. Most traditional detection methods are based on static analysis with signature matching and dynamic analysis methods that are focused on sensitive behaviors. However, the usual detections have only limited effect when meeting the development of malware, so that the manual update for feature sets is essential. Besides, most of these methods match target samples with the usual feature database, which ignored the characteristics of the sample itself. In this paper, we propose a new malware detection method that could combine the features of a single sample and the general features of malware. Firstly, a structure of Directed Cyclic Graph (DCG) is adopted to extract features from samples. Then the sensitivity of each API call is computed with Markov Chain. Afterward, the graph is merged with the chain to get the final features. Finally, the detectors based on machine learning or deep learning are devised for identification. To evaluate the effect and robustness of our approach, several experiments were adopted. The results showed that the proposed method had a good performance in most tests, and the approach also had stability with the development and growth of malware.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.1
• /
• pp.89-94
• /
• 2009

This paper proposes the algorithms that design the highly digital logic circuit and assign the code to each node of DCG(Directed Cyclic Graph) of length ${\zeta}$. The conventional algorithm have some problems, so this paper introduce the matrix equation from DCG of length ${\zeta}$ and proposes highly digital logic circuit design algorithms according to the DCG of length ${\zeta}$. Using the proposed circuit design algorithms in this paper, it become realized that was able to design from former algorithm. Also, making a comparison between the circuit using former algorithm and this paper's, we testify that proposed paper's algorithm is able to realize more optimized circuit design. According to proposed circuit design algorithm in this paper, it is possible to design current that DCG have natural number, so it have the following advantages, reduction of the circuit input/output digits, simplification of circuit composition, reduction of computation time and cost. And we show comparability and verification about this paper's algorithm.