Absolute Mean Cordial Labelling

Abstract

The focus of this article is to demonstrate a new graph labeling which is called absolute mean cordial labeling. We proved every triangular snake T_r, ∀ r ≥ 3, cycle C_s, s ≥ 4,s 6= 5, friendship graph F_t, helm graph H_m, alternate triangular snake AT_r, ∀ r ≥ 3, double triangular snake DT_r, ∀ r ≥ 3, double alternate triangular snake DA(T_r), ∀ r ≥ 3 are absolute mean cordial graphs.