The Average Cordial Labeling in Separate Graphs

Abstract

In a graph G(V,E) is a mapping  such that  and the mapping satisfies the condition where contributes the total number of edges that have the label. The graph is referred to as a total mean cordial graph as it is composed of total mean cordial labels. The total mean cordial labeling in a variety of graphs, including brush, ladder, and triangular ladder graphs, will be examined in this work. Provide examples to further clarify the theory.