• Journal of applied mathematics & informatics
• /
• v.35 no.1_2
• /
• pp.95-111
• /
• 2017

Recently, interval-valued fuzzy graph is a growing research topic as it is the generalization of fuzzy graphs. The interval-valued fuzzy graphs are more flexible and compatible than fuzzy graphs due to the fact that they allowed the degree of membership of a vertex to an edge to be represented by interval values in [0.1] rather than the crisp values between 0 and 1. In this paper, we introduce the concepts of regular and totally regular interval-valued fuzzy graphs and discusses some properties of the ${\mu}$-complement of interval-valued fuzzy graph. Self ${\mu}$-complementary interval-valued fuzzy graphs and self-weak ${\mu}$-complementary interval-valued fuzzy graphs are defined and a necessary condition for an interval valued fuzzy graph to be self ${\mu}$-complementary is discussed. We define busy vertices and free vertices in interval valued fuzzy graph and study their image under an isomorphism.

• Journal of applied mathematics & informatics
• /
• v.22 no.1_2
• /
• pp.83-93
• /
• 2006

A graph is k-cyclable if given k vertices there is a cycle that contains the k vertices. Sallee showed that every finite 3-connected planar graph is 5-cyclable. In this paper, by characterizing the circuit graphs and investigating the structure of LV-graphs, we extend his result to 3-connected infinite locally finite VAP-free plane graphs.

• Journal of applied mathematics & informatics
• /
• v.19 no.1_2
• /
• pp.537-543
• /
• 2005

A graph is k-cyclable if given k vertices there is a cycle that contains the k vertices. Sallee showed that every finite 3-connected planar graph is 5-cyclable. In this paper Sallee's result is extended to 3-connected infinite locally finite VAP-free plane graphs containing no unbounded faces.

• Journal of electromagnetic engineering and science
• /
• v.13 no.1
• /
• pp.16-21
• /
• 2013

This study presents the angular effects of virtual vertices inserted for effective treatment of the boundary edge laid on an infinite conducting surface in a half-space scattering problem. We investigated the angular effects of virtual vertices by first computing the radar cross section (RCS) of a specific scatterer; i.e., a tilted conducting plate in contact with the ground surface, by inserting the virtual vertex in half-space. Here, the electric field integral equation is used to solve this problem with various virtual vertex angles (${\theta}_{\nu}$) and conducting plate inclination angles (${\theta}_r$) ranging from $0^{\circ}$ to $180^{\circ}$. The effects of the angles ${\theta}_{\nu}$ and ${\theta}_r$ on the RCS computation are clearly shown with numerical results with and without the virtual vertices in free- and half-spaces.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.1_2
• /
• pp.86-94
• /
• 2004

In this paper, we show that $ G(2^m, 4), m{\geq}3$with at most m-2 faulty elements has a fault-free cycle of length 1 for every ${\leq}1{\leq}2^m-f_v$ is the number of faulty vertices. To achieve our purpose, we define a graph G to be k-fault hypohamiltonian-connected if for any set F of faulty elements, G- F has a fault-free path joining every pair of fault-free vertices whose length is shorter than a hamiltonian path by one, and then show that$ G(2^m, 4), m{\geq}3$ is m-3-fault hypohamiltonian-connected.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.4
• /
• pp.27-33
• /
• 2019

The min-cut problem that decides the maximum flow in a complex network flows from source(s) to sink(t) is known as a hard problem. The augmenting path algorithm divides into single path and decides the bottleneck point(edge), but the min-cut section to be decide additionally. This paper suggests O(n) time complexity heuristic greedy algorithm for the number of vertices n that applies free agent system in a pro-sports field. The free agent method assumes $N_G(S),N_G(T)$vertices among $v{\in}V{\backslash}\{s,t\}$to free agent players, and this players transfer into the team that suggest more annual income. As a result of various networks, this algorithm can be finds all of min-cut sections and min-cut value for whole cases.

• Journal of applied mathematics & informatics
• /
• v.2 no.1
• /
• pp.59-83
• /
• 1995

In this paper, we proved the set of points which are the vertices of the n-gon in $mathbb{P}^2(n\geq3$)$ has the Uniform Position Property and what the graded free resolutions of the ideals of k-configurations in $mathbb{P}^3$ are.

• Journal of the Korean Society of Visualization
• /
• v.3 no.1
• /
• pp.51-57
• /
• 2005

Vertices terminating at free surface have been investigated extensively. Most of investigations, however, are focused on surface parallel vortices and little has been known about surface normal vortex or columnar vortex. Visualized experimental results utilizing LIF technique are discussed fur the purpose of characterization of columnar vortex interacting with a clean and a contaminated free surfaces and a solid body interface in the present investigation. The results reveal that surface tension changes due to surface contamination although bulk viscosity remains constant and eventually the behavior of a columnar vortex interacting with a contaminated free surface and a solid body interface are totally different from the clean free surface case.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.1_2
• /
• pp.19-26
• /
• 2004

In this paper, we investigate the longest fault-free paths joining every pair of vertices in a double loop network with faulty vertices and/or edges, and show that a bipartite double loop network G(mn；1, m) is strongly hamiltonian-laceable when the number of faulty elements is two or less. G(mn；1, m) is bipartite if and only if m is odd and n is even.

• Genomics & Informatics
• /
• v.6 no.3
• /
• pp.147-152
• /
• 2008

The basic graph layout technique, one of many visualization techniques, deals with the problem of positioning vertices in a way to maximize some measure of desirability in a graph. The technique is becoming critically important for further development of the field of systems biology. However, applying the appropriate automatic graph layout techniques to the genomic scale flow of metabolism requires an understanding of the characteristics and patterns of duplicate and shared vertices, which is crucial for bioinformatics software developers. In this paper, we provide the results of parsing KEGG XML files from a graph-theoretical perspective, for future research in the area of automatic layout techniques in biological pathway domains.