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

Let G = (V, E) be a graph with p-vertices and q-edges and let R^◦ be a finite zero ring of order n. An injective function f : V (G) → {r₁, r₂, _…, r_k}, where r_i ∈ R^◦ is called vertex pair sum k-zero ring labeling, if it is possible to label the vertices x ∈ V with distinct labels from R^◦ such that each edge e = uv is labeled with f(e = uv) = [f(u) + f(v)] (mod n) and the edge labels are distinct. A graph admits such labeling is called vertex pair sum k-zero ring graph. The minimum value of positive integer k for a graph G which admits a vertex pair sum k-zero ring labeling is called the vertex pair sum k-zero ring index denoted by 𝜓_pz(G). In this paper, we defined the vertex pair sum k-zero ring labeling and applied to some graphs.

• 대한원격탐사학회지
• /
• 제5권2호
• /
• pp.85-90
• /
• 1989

A new graph-theoretic clustering method based on relaxation labeling is proposed. More accurate classification is achieved by using relaxation labeling which take advantage of contextual information. Moreover, threshold selection is not needed in this method.

• Journal of applied mathematics & informatics
• /
• 제39권1_2호
• /
• pp.223-237
• /
• 2021

Let G = (V (G), E(G)) be a graph and let g : V (G) → S3 be a function. For each edge xy assign the label r where r is the remainder when o(g(x)) is divided by o(g(y)) or o(g(y)) is divided by o(g(x)) according as o(g(x)) ≥ o(g(y)) or o(g(y)) ≥ o(g(x)). The function g is called a group S3 cordial remainder labeling of G if |vg(i)-vg(j)| ≤ 1 and |eg(1)-eg(0)| ≤ 1, where vg(j) denotes the number of vertices labeled with j and eg(i) denotes the number of edges labeled with i (i = 0, 1). A graph G which admits a group S3 cordial remainder labeling is called a group S3 cordial remainder graph. In this paper, we prove that square of the path, duplication of a vertex by a new edge in path and cycle graphs, duplication of an edge by a new vertex in path and cycle graphs and total graph of cycle and path graphs admit a group S3 cordial remainder labeling.

• Journal of applied mathematics & informatics
• /
• 제30권5_6호
• /
• pp.913-923
• /
• 2012

The Odd-Even graceful labeling of a graph G with $q$ edges means that there is an injection $f:V (G)$ to $\{1,3,5,{\cdots},2q+1\}$ such that, when each edge $uv$ is assigned the label ${\mid}f(u)-f(v){\mid}$, the resulting edge labels are $\{2,4,6,{\cdots},2q\}$. A graph which admits an odd-even graceful labeling is called an odd-even graceful graph. In this paper, we prove that some well known graphs namely $P_n$, $P_n^+$, $K_{1,n}$, $K_{1,2,n}$, $K_{m,n}$, $B_{m,n}$ are Odd-Even graceful.

• 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.

• 전자공학회논문지CI
• /
• 제42권1호
• /
• pp.27-34
• /
• 2005

본 논문에서는 그래프 임베딩 문제와 관련된 이항트리에서의 Q-에지 번호매김 방법을 제안한다. 이러한 연구결과는 신뢰성이 높은 통신망을 설계하는 최적화 문제인 "n 개의 노드와 e 개의 에지를 가지면서 연결도가 최대인 그래프를 구성하라."를 해결한 Harary 그래프의 일반화인 원형군 그래프(circulant graph)의 점프열로 Q-에지번호들을 이용하면 연결도가 최대인 신뢰성이 높은 새로운 상호연결망(interconnection networks)의 위상을 설계할 수 있다. 그리고 이러한 위상은 이항트리를 스패닝 트리로 가지므로 최적방송이 가능하다.

• Journal of applied mathematics & informatics
• /
• 제38권3_4호
• /
• pp.221-238
• /
• 2020

Let G = (V (G), E(G)) be a graph and let g : V (G) → S₃ be a function. For each edge xy assign the label r where r is the remainder when o(g(x)) is divided by o(g(y)) or o(g(y)) is divided by o(g(x)) according as o(g(x)) ≥ o(g(y)) or o(g(y)) ≥ o(g(x)). The function g is called a group S₃ cordial remainder labeling of G if |v_g(i)-v_g(j)| ≤ 1 and |e_g(1)-e_g(0)| ≤ 1, where v_g(j) denotes the number of vertices labeled with j and e_g(i) denotes the number of edges labeled with i (i = 0, 1). A graph G which admits a group S₃ cordial remainder labeling is called a group S₃ cordial remainder graph. In this paper, we prove that subdivision of graphs admit a group S₃ cordial remainder labeling.

• 한국지능시스템학회논문지
• /
• 제21권1호
• /
• pp.138-144
• /
• 2011

그래프 G = (V, E )의 L(2, 1)-labeling 은 무선통신에서 무선 기기에 할당되는 주파수를 효율적으로 사용하기 위한 최적화 문제로서 NP-complete 계열에 포함되는 문제이다. 본 연구에서는 L(2, 1)-labeling 문제에 적용 가능한 Simulated Annealing 알고리즘을 제시한 후 다양한 그래프에 제시된 알고리즘을 적용하여 그 효용성을 보이고자 한다.

• Journal of applied mathematics & informatics
• /
• 제34권1_2호
• /
• pp.9-17
• /
• 2016

In this paper, it has been shown that the hairy cycle C_n ⊙ rK₁, n ≡ 3(mod4), the graph obtained by adding pendant edge to each pendant vertex of hairy cycle C_n ⊙ 1K₁, n ≡ 0(mod4), double graph of path P_n and double graph of comb P_n ⊙ 1K₁ are k-graceful.

• 한국정보처리학회논문지
• /
• 제6권8호
• /
• pp.2124-2132
• /
• 1999

Given a graph G=(V,E), Ld(2,1)-labeling of G is a function f : V(G)$\longrightarrow$[0,$\infty$) such that, if v1,v2$\in$V are adjacent, $\mid$ f(x)-f(y) $\mid$$\geq$2d, and, if the distance between and is two, $\mid$ f(x)-f(y) $\mid$$\geq$d, where dG(,v2) is shortest distance between v1 and in G. The L(2,1)-labeling number (G) is the smallest number m such that G has an L(2,1)-labeling f with maximum m of f(v) for v$\in$V. This problem has been studied by Griggs, Yeh and Sakai for the various classes of graphs. In this paper, we discuss the upper-bound of ${\lambda}$ (G) for a chordal graph G and that of ${\lambda}$(G') for a permutation graph G'.