Some Results on Strongly*-2 Divisor Cordial Labeling
Main Article Content
Abstract
A strongly*-2 divisor cordial labeling of a graph with the vertex set is a bijection such that each edge assigned the label 1 if is odd and 0 if is even, then the number of edges labeled with 0 and the number of edges labeled with 1 differs by atmost 1. A graph which admits a Strongly*-2 divisor cordial labeling is called a Srongly*-2 divisor cordial graph. In this paper, we proved that Path, Cycle, Star and comb graph are Strongly*-2 divisor cordial graphs
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.
