• Journal of applied mathematics & informatics
• /
• 제35권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
• /
• 제22권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
• /
• 제19권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
• /
• 제13권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.

• 한국정보과학회논문지:시스템및이론
• /
• 제31권1_2호
• /
• pp.86-94
• /
• 2004

이 논문에서는 재귀원형군 $ G(2^m, 4), m{\geq}3$은 고장인 요소의 수가 m-2개 이하일 때, 임의의 1, 4 ${\leq}1{\leq}2^m-f_v$에 대하여 길이 1인 고장 없는 사이클을 가짐을 보인다. 여기서, f$_{v}$ 는 고장 정점의 수이다. 이를 위하여, ｜F｜$\leq$k인 임의의 고장 요소 집합 F에 대해서 G-F가 임의의 두 정점을 잇는 길이가 해밀톤 경로보다 하나 작은 경로를 가질 때, G를 k-고장 하이포해밀톤 연결된 그래프라고 정의하고, $ G(2^m, 4), m{\geq}3$은 m-3-고장 하이포해밀톤 연결된 그래프임을 보인다.

• 한국인터넷방송통신학회논문지
• /
• 제19권4호
• /
• pp.27-33
• /
• 2019

공급지(s)에서 수요지(t)로 흐르는 복잡한 망에서 망의 최대 흐름을 결정하는 최소절단 면을 찾는 최소절단 문제는 난제로 알려져 있다. 이에 대해 증대경로 알고리즘은 증대경로를 갖는 단일 경로로 분할하여 병목 지점(간선)을 찾는 방식을 채택하고 있으나 최소절단면을 추가적으로 결정해야만 한다. 본 논문에서는 프로스포츠계에서 적용되고 있는 자유계약제 방식을 적용하여, 정점 수 n에 대해 수행 복잡도가 O(n)인 휴리스틱 탐욕 알고리즘을 제안한다. 자유계약 방식은 $v{\in}V{\backslash}\{s,t\}$정점들 중에서 $N_G(S),N_G(T)$정점들을 자유계약 선수라고 가정하고, 이 선수들의 연봉이 보다 상승하는 팀으로 이적하는 방식을 적용하였다. 제안된 알고리즘을 다양한 망 형태에 적용한 결과, 모든 망에서 최소절단 치 뿐 아니라 망에 존재하는 모든 최소절단 들을 찾을 수 있음을 보였다.

• Journal of applied mathematics & informatics
• /
• 제2권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.

• 한국가시화정보학회지
• /
• 제3권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.

• 한국정보과학회논문지:시스템및이론
• /
• 제31권1_2호
• /
• pp.19-26
• /
• 2004

이 논문에서는 정점이나 에지 고장이 있는 이중 루프 네트워크에서 임의의 두 정점을 연결하는 고장 없는 최장 경로를 고찰하여, 고장인 요소의 수가 둘 흑은 그 이하인 경우 이분 그래프인 이중 루프 네트워크 G(mn；1, m)은 강한 해밀톤 laceable 그래프임을 보인다. G(mn；1, m)은 m이 홀수이고 n이 짝수일 경우에만 이분 그래프이다.

• Genomics & Informatics
• /
• 제6권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.