Group Difference Cordial Labeling of some Ladder related Graphs
Main Article Content
Abstract
Let be a graph. Let be a group. For let denotes
the order of in Let be a function. For eachedge assign the label Let denote the number of vertices of having label under Alsorespectively denote the number of edges labeled withand not with .Nowis called a group difference cordial labeling if for every and . A graph which admits a group difference cordial labeling is called group difference cordial graph. In this paper we fix the groupas the group which is the group of fourth roots of unity, that is cyclic with generators
We prove that Open ladder, Slanting ladder and further characterized .
Downloads
Metrics
Article Details
Licensing
TURCOMAT publishes articles under the Creative Commons Attribution 4.0 International License (CC BY 4.0). This licensing allows for any use of the work, provided the original author(s) and source are credited, thereby facilitating the free exchange and use of research for the advancement of knowledge.
Detailed Licensing Terms
Attribution (BY): Users must give appropriate credit, provide a link to the license, and indicate if changes were made. Users may do so in any reasonable manner, but not in any way that suggests the licensor endorses them or their use.
No Additional Restrictions: Users may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.