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
You are free to:
- Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
- Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.
