Liouville difference cordial labeling of some acyclic graphs

Graph Labeling is one of the prominent and continuously evolving areas within the field of Graph theory. It involves assigning integers to the vertices, edges, or both, based on specific criteria. Among various labeling techniques, in this paper we introduced a new labeling called Liouville Difference Cordial labeling which is defined as: Let G = (V, E) be a simple graph with vertex set V and edge set E. A 1-1 function is said to be a Liouville Difference Cordial labeling of the graph G if the induced edge function is defined by with the condition for all where is the number of edges labeled with k. In this paper, the behavior of Liouville Difference Cordial labeling has been studied for some acyclic graphs such as and .