• 제목/요약/키워드: normal adjacency

검색결과 10건 처리시간 0.024초

AN EQUIVALENT PROPERTY OF A NORMAL ADJACENCY OF A DIGITAL PRODUCT

  • Han, Sang-Eon
    • 호남수학학술지
    • /
    • 제36권1호
    • /
    • pp.199-215
    • /
    • 2014
  • Owing to the development of the notion of normal adjacency of a digital product [9], product properties of digital topological properties were studied efficiently. To equivalently represent a normal adjacency of a digital product, the present paper proposes an S-compatible adjacency of a digital product. This approach can be helpful to understand a normal adjacency of a digital product. Finally, using an S-compatible adjacency of a digital product, we can study product properties of digital topological properties, which improves the presentations of the normal adjacency of a digital product in [9] and [5, 6].

COMPARISON AMONG SEVERAL ADJACENCY PROPERTIES FOR A DIGITAL PRODUCT

  • Han, Sang-Eon
    • 호남수학학술지
    • /
    • 제37권1호
    • /
    • pp.135-147
    • /
    • 2015
  • Owing to the notion of a normal adjacency for a digital product in [8], the study of product properties of digital topological properties has been substantially done. To explain a normal adjacency of a digital product more efficiently, the recent paper [22] proposed an S-compatible adjacency of a digital product. Using an S-compatible adjacency of a digital product, we also study product properties of digital topological properties, which improves the presentations of a normal adjacency of a digital product in [8]. Besides, the paper [16] studied the product property of two digital covering maps in terms of the $L_S$- and the $L_C$-property of a digital product which plays an important role in studying digital covering and digital homotopy theory. Further, by using HS- and HC-properties of digital products, the paper [18] studied multiplicative properties of a digital fundamental group. The present paper compares among several kinds of adjacency relations for digital products and proposes their own merits and further, deals with the problem: consider a Cartesian product of two simple closed $k_i$-curves with $l_i$ elements in $Z^{n_i}$, $i{\in}\{1,2\}$ denoted by $SC^{n_1,l_1}_{k_1}{\times}SC^{n_2,l_2}_{k_2}$. Since a normal adjacency for this product and the $L_C$-property are different from each other, the present paper address the problem: for the digital product does it have both a normal k-adjacency of $Z^{n_1+n_2}$ and another adjacency satisfying the $L_C$-property? This research plays an important role in studying product properties of digital topological properties.

REMARKS ON DIGITAL PRODUCTS WITH NORMAL ADJACENCY RELATIONS

  • Han, Sang-Eon;Lee, Sik
    • 호남수학학술지
    • /
    • 제35권3호
    • /
    • pp.515-524
    • /
    • 2013
  • To study product properties of digital spaces, we strongly need to formulate meaningful adjacency relations on digital products. Thus the paper [7] firstly developed a normal adjacency relation on a digital product which can play an important role in studying the multiplicative property of a digital fundamental group, and product properties of digital coverings and digitally continuous maps. The present paper mainly surveys the normal adjacency relation on a digital product, improves the assertion of Boxer and Karaca in the paper [4] and restates Theorem 6.4 of the paper [19].

GRAPHS AND NON-NORMAL OPERATOR(I)

  • Park, Young-Sik
    • East Asian mathematical journal
    • /
    • 제16권1호
    • /
    • pp.147-159
    • /
    • 2000
  • In this paper, we investigate the properties of non-normal(convexoid, hyponormal) adjacency operators for a graph under two operations, tensor product and Cartesian one.

  • PDF

STUDY ON TOPOLOGICAL SPACES WITH THE SEMI-T½ SEPARATION AXIOM

  • Han, Sang-Eon
    • 호남수학학술지
    • /
    • 제35권4호
    • /
    • pp.707-716
    • /
    • 2013
  • The present paper consists of two parts. Since the recent paper [4] proved that an Alexandroff $T_0$-space is a semi-$T_{\frac{1}{2}}$-space, the first part studies semi-open and semi-closed structures of the Khalimsky nD space. The second one focuses on the study of a relation between the LS-property of ($SC^{n_1,l_1}_{k_1}{\times}SC^{n_2,l_2}_{k_2}$, k) relative to the simple closed $k_i$-curves $SC^{n_i,l_i}_{k_i}$, $i{\in}\{1,2\}$ and its normal k-adjacency. In addition, the present paper points out that the main theorems of Boxer and Karaca's paper [3] such as Theorems 4.4 and 4.7 of [3] cannot be new assertions. Indeed, instead they should be attributed to Theorems 4.3 and 4.5, and Example 4.6 of [10].

A𝛼-SPECTRAL EXTREMA OF GRAPHS WITH GIVEN SIZE AND MATCHING NUMBER

  • Xingyu Lei;Shuchao Li;Jianfeng Wang
    • 대한수학회보
    • /
    • 제60권4호
    • /
    • pp.873-893
    • /
    • 2023
  • In 2017, Nikiforov proposed the A𝛼-matrix of a graph G. This novel matrix is defined as A𝛼(G) = 𝛼D(G) + (1 - 𝛼)A(G), 𝛼 ∈ [0, 1], where D(G) and A(G) are the degree diagonal matrix and adjacency matrix of G, respectively. Recently, Zhai, Xue and Liu [39] considered the Brualdi-Hoffman-type problem for Q-spectra of graphs with given matching number. As a continuance of it, in this contribution we consider the Brualdi-Hoffman-type problem for A𝛼-spectra of graphs with given matching number. We identify the graphs with given size and matching number having the largest A𝛼-spectral radius for ${\alpha}{\in}[{\frac{1}{2}},1)$.

UTILITY OF DIGITAL COVERING THEORY

  • Han, Sang-Eon;Lee, Sik
    • 호남수학학술지
    • /
    • 제36권3호
    • /
    • pp.695-706
    • /
    • 2014
  • Various properties of digital covering spaces have been substantially used in studying digital homotopic properties of digital images. In particular, these are so related to the study of a digital fundamental group, a classification of digital images, an automorphism group of a digital covering space and so forth. The goal of the present paper, as a survey article, to speak out utility of digital covering theory. Besides, the present paper recalls that the papers [1, 4, 30] took their own approaches into the study of a digital fundamental group. For instance, they consider the digital fundamental group of the special digital image (X, 4), where X := $SC^{2,8}_4$ which is a simple closed 4-curve with eight elements in $Z^2$, as a group which is isomorphic to an infinite cyclic group such as (Z, +). In spite of this approach, they could not propose any digital topological tools to get the result. Namely, the papers [4, 30] consider a simple closed 4 or 8-curve to be a kind of simple closed curve from the viewpoint of a Hausdorff topological structure, i.e. a continuous analogue induced by an algebraic topological approach. However, in digital topology we need to develop a digital topological tool to calculate a digital fundamental group of a given digital space. Finally, the paper [9] firstly developed the notion of a digital covering space and further, the advanced and simplified version was proposed in [21]. Thus the present paper refers the history and the process of calculating a digital fundamental group by using various tools and some utilities of digital covering spaces. Furthermore, we deal with some parts of the preprint [11] which were not published in a journal (see Theorems 4.3 and 4.4). Finally, the paper suggests an efficient process of the calculation of digital fundamental groups of digital images.

공정계획의 자동화를 위한 각주형 파트의 특징형상 인식 : 확장된 AAG 접근 방법 (Feature Recognition of Prismatic Parts for Automated Process Planning : An Extended AAG A, pp.oach)

  • 지원철;김민식
    • 지능정보연구
    • /
    • 제2권1호
    • /
    • pp.45-58
    • /
    • 1996
  • This paper describes an a, pp.oach to recognizing composite features of prismatic parts. AAG (Attribute Adjacency Graph) is adopted as the basis of describing basic feature, but it is extended to enhance the expressive power of AAG by adding face type, angles between faces and normal vectors. Our a, pp.oach is called Extended AAG (EAAG). To simplify the recognition procedure, feature classification tree is built using the graph types of EEA and the number of EAD's. Algorithms to find open faces and dimensions of features are exemplified and used in decomposing composite feature. The processing sequence of recognized features is automatically determined during the decomposition process of composite features.

  • PDF

자기교차를 가지는 곡선 재구성 (Reconstructing Curves With Self-intersections)

  • 김형석
    • 한국정보통신학회논문지
    • /
    • 제14권9호
    • /
    • pp.2016-2022
    • /
    • 2010
  • 점들의 집합으로부터 곡선이나 곡면을 구성하는 문제는 기하학적 모델링, 컴퓨터그래픽스, 영상처리 등의 분야에서 중요한 역할을 수행하고 있다. 특히 곡선 재구성 문제는 기존에 존재하는 곡선으로부터 샘플링된 점들로부터 순서를 부여하여 점들을 연결하는 문제이다. 이러한 문제에 대한 대부분의 기존 방법들은 유클리언 거리를 기초로 하고 있기 때문에 자기교차를 가지고 있는 곡선의 재구성 문제를 해결하지 못하고 있는 실정이다. 본 논문에서는 이러한 문제점을 해결하기 위하여 방향도 함께 고려하는 거리를 제안하고, 이를 이용하여 데이터 점들에게 순서를 부여하는 알고리즘을 제안한다. 본 논문에서 제안하는 거리함수는 브라운 운동의 확산 특성을 반영한 것으로서, 다음 점의 위치에 대한 정보를 표준정규분포로 전환함에 의해서 유도되었다. 본 논문의 우수성은 기존의 방법으로는 해결하지 못했던 자기교차 곡선 재구성 문제를 해결할 수 있다는 점이다.