http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
4-TOTAL DIFFERENCE CORDIAL LABELING OF SOME SPECIAL GRAPHS
PONRAJ, R.,PHILIP, S. YESU DOSS,KALA, R. The Korean Society for Computational and Applied M 2022 Journal of applied and pure mathematics Vol.4 No.1/2
Let G be a graph. Let f : V (G) → {0, 1, 2, …, k-1} be a map where k ∈ ℕ and k > 1. For each edge uv, assign the label |f(u) - f(v)|. f is called k-total difference cordial labeling of G if |t<sub>df</sub> (i) - t<sub>df</sub> (j) | ≤ 1, i, j ∈ {0, 1, 2, …, k - 1} where t<sub>df</sub> (x) denotes the total number of vertices and the edges labeled with x. A graph with admits a k-total difference cordial labeling is called k-total difference cordial graphs. In this paper we investigate the 4-total difference cordial labeling behaviour of shell butterfly graph, Lilly graph, Shackle graphs etc..
4-total difference cordial labeling of some special graphs
R. Ponraj,S. Yesu Doss Philip,R. Kala 한국전산응용수학회 2022 Journal of Applied and Pure Mathematics Vol.4 No.1
Let G be a graph. Let f:V(G)\to\{0,1,2, \ldots, k-1\} be a map where k \in \mathbb{N} and k>1. For each edge uv, assign the label \left|f(u)-f(v)\right|. f is called k-total difference cordial labeling of G if \left|t_{df}(i)-t_{df}(j)\right|\leq 1, i,j \in \{0,1,2,\ldots,k-1\} where t_{df}(x) denotes the total number of vertices and the edges labeled with x. A graph with admits a k-total difference cordial labeling is called k-total difference cordial graphs. In this paper we investigate the 4-total difference cordial labeling behaviour of shell butterfly graph, Lilly graph, Shackle graphs etc..