Centered triangular difference mean graphs

Abstract

A graph G = (V, E) with p vertices and q edges is said to have centered triangular difference mean labeling if there is an injective mapping f: V(G)→ Z⁺such that for each edge e = uv, f ∗(e) = [1f(u)-(v)/2 and the resulting edge labels are the first q centered triangular numbers. A graph that admits a centered triangular difference mean labeling is called a centered triangular difference mean graph. In this paper, we prove that the path P_n, K_1,n, C_no˙ K₁, B_m,n, C_n(n > 4), coconut tree, caterpillar S(n₁,n₂, n₃,...,n_m), C_n@P_m(n > 4) and S_m,nare centered triangular difference mean graphs. © 2019 Utilitas Mathematica Publishing Inc.. All rights reserved.