• Journal of applied mathematics & informatics
• /
• v.32 no.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.

• Journal of the Korea Computer Graphics Society
• /
• v.7 no.3
• /
• pp.9-18
• /
• 2001

Feature detection is important in various mesh processing techniques, such as mesh editing, mesh morphing, mesh compression, and mesh signal processing. In this paper, we propose a geometric snake as an interactive tool for feature detection on a 3D triangular mesh. A geometric snake is an extension of an image snake, which is an active contour model that slithers from its initial position specified by the user to a nearby feature while minimizing an energy functional. To constrain the movement of a geometric snake onto the surface of a mesh, we use the parameterization of the surrounding region of a geometric snake. Although the definition of a feature may vary among applications, we use the normal changes of faces to detect features on a mesh.

• Journal of applied mathematics & informatics
• /
• v.42 no.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
• /
• v.42 no.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
• /
• v.39 no.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
• /
• v.37 no.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.

• Journal of Korean Society of Coastal and Ocean Engineers
• /
• v.34 no.4
• /
• pp.93-99
• /
• 2022

Analytical solutions for regular waves generated by bottom wave makers in a 3-dimensional wave basin were derived in this study. Bottom wave makers which have triangular, rectangular and combination of two shapes were adopted. The 3-dimensional velocity potential was derived based on the linear wave theory with the bottom moving boundary condition, kinematic and dynamic free surface boundary conditions in a wave basin. Then, analytical solutions of 3-dimensional particle velocities and free surface displacement were derived from the velocity potential. The solutions showed physically valid results for regular waves generated by bottom wave makers in a wave basin. The analytical solution for obliquely propagating wave generation from bottom wave maker which works like a snake was also derived. Numerical results of the solution agree well with theoretically predicted results.

• Proceedings of the KSRS Conference
• /
• 2007.10a
• /
• 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.