• Journal of applied mathematics & informatics
• /
• 제32권3_4호
• /
• pp.377-387
• /
• 2014

Let G be a (p, q) graph. Let f be a map from V (G) to {1, 2, ${\ldots}$, p}. For each edge uv, assign the label ${\mid}f(u)-f(\nu){\mid}$. f is called a difference cordial labeling if f is a one to one map and ${\mid}e_f(0)-e_f(1){\mid}{\leq}1$ where $e_f(1)$ and $e_f(0)$ denote the number of edges labeled with 1 and not labeled with 1 respectively. A graph with admits a difference cordial labeling is called a difference cordial graph. In this paper, we investigate the difference cordial labeling behavior of triangular snake, Quadrilateral snake, double triangular snake, double quadrilateral snake and alternate snakes.

• 한국컴퓨터그래픽스학회논문지
• /
• 제7권3호
• /
• pp.9-18
• /
• 2001

삼각 메쉬의 특징점을 찾는 것은 메쉬 편집, 메쉬 몰핑, 메쉬 압축, 메쉬 신호처리 등 여러 가지 응용 분야에서 중요하게 사용된다. 본 논문에서는 삼각 메쉬의 특징점을 찾기 위한 방법으로 기하학 스네이크를 제시하였다. 기하학 스네이크는 영상 스네이크를 확장한 것으로, 사용자가 초기 위치를 정하면 에너지 함수를 최소화함으로써 가까이에 있는 특징점을 찾는다. 기하학 스네이크는 항상 메쉬 표면 위에서만 이동하여야 하므로 메쉬를 매개 변수화하여 스네이크를 이차원 상에 매핑된 메쉬상에서 이동시켰다. 스네이크를 특징점으로 이동시키기 위한 외부 에너지는 메쉬 표면의 노말 변화를 이용하여 계산하였다.

• Journal of applied mathematics & informatics
• /
• 제42권2호
• /
• pp.353-366
• /
• 2024

A total coloring of a graph G is an assignment of colors to both the vertices and edges of G, such that no two adjacent or incident vertices and edges of G are assigned the same colors. In this paper, we have discussed the total coloring of M(T_n), M(D_n), M(DT_n), M(AT_n), M(DA(T_n)), M(Q_n), M(AQ_n) and also obtained the total chromatic number of M(T_n), M(D_n), M(DT_n), M(AT_n), M(DA(T_n)), M(Q_n), M(AQ_n).

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

• Journal of applied mathematics & informatics
• /
• 제39권3_4호
• /
• pp.497-506
• /
• 2021

Let G be a graph. Let f : V (G) → {0, 1, …, k - 1} be a function where k ∈ ℕ and k > 1. For each edge uv, assign the label $f(uv)={\lceil}{\frac{f(u)+f(v)}{2}}{\rceil}$. f is called k-total mean cordial labeling of G if ${\mid}t_{mf}(i)-t_{mf}(j){\mid}{\leq}1$, for all i, j ∈ {0, 1, …, k - 1}, where t_mf (x) denotes the total number of vertices and edges labelled with x, x ∈ {0, 1, …, k-1}. A graph with admit a k-total mean cordial labeling is called k-total mean cordial graph.

• Journal of applied mathematics & informatics
• /
• 제37권1_2호
• /
• pp.149-156
• /
• 2019

Let G be a (p, q) graph. Let $f:V(G){\rightarrow}\{1,2,{\ldots},k\}$ be a map where $k{\in}{\mathbb{N}}$ and k > 1. For each edge uv, assign the label gcd(f(u), f(v)). f is called k-Total prime cordial labeling of G if ${\mid}t_f(i)-t_f(j){\mid}{\leq}1$, $i,j{\in}\{1,2,{\ldots},k\}$ where $t_f$(x) denotes the total number of vertices and the edges labelled with x. A graph with a k-total prime cordial labeling is called k-total prime cordial graph. In this paper we investigate the 4-total prime cordial labeling of some graphs.

• 한국해안·해양공학회논문집
• /
• 제34권4호
• /
• pp.93-99
• /
• 2022

본 연구에서는 바닥 조파장치가 설치된 3차원 조파수조에서 재현된 규칙파에 대한 해석해를 유도하였다. 바닥 조파장치로 삼각형 형상, 사각형 형상 및 두 형상이 복합된 형상이 적용되었다. 선형파 이론과 움직이는 바닥에 대한 경계조건, 동역학적 및 운동학적 자유수면 경계조건을 이용하여 조파수조 내의 3차원 속도포텐셜을 유도하였다. 그리고, 이로부터 각 방향 성분의 유속과 자유수면변위에 대한 해석해를 구하였다. 유도된 해석해는 바닥 조파장치가 설치된 조파수조에서 규칙파의 전파 특성에 대해 물리적으로 타당한 결과를 보였다. 바닥 조파장치가 snake 형태로 움직이는 경우의 비스듬히 전파하는 파랑의 조파에 대해서도 해석해를 유도하였으며, 해석 결과는 이론적으로 예측한 결과와 일치하였다.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2007년도 Proceedings of ISRS 2007
• /
• pp.238-242
• /
• 2007

Today's commercial high resolution satellite imagery such as that provided by IKONOS and QuickBird, offers the potential to extract useful spatial information for geographical database construction and GIS applications. Digital maps supply the most generally used GIS data probiding topography, road, and building information. Currently, the building information provided by digital maps is incompletely constructed for GIS applications due to planar position error and warped shape. We focus on extracting of the accurate building information including position, shape, and height to update the building information of the digital maps and GIS database. In this paper, we propose a new method of 3D building information extraction with a single high resolution satellite image and digital map. Co-registration between the QuickBird image and the 1:1,000 digital maps was carried out automatically using the RPC adjustment model and the building layer of the digital map was projected onto the image. The building roof boundaries were detected using the building layer from the digital map based on the satellite azimuth. The building shape could be modified using a snake algorithm. Then we measured the building height and traced the building bottom automatically using triangular vector structure (TVS) hypothesis. In order to evaluate the proposed method, we estimated accuracy of the extracted building information using LiDAR DSM.