Total cordial labeling of corona product of paths and second power of fan graph
Main Article Content
Abstract
A graph is called total cordial if it has a labeling such that the total number of vertices and edges labelled with ones and zeros differ by at most one. In this paper, we contribute some new results on Total Product cordial labeling and investigate necessary and sufficient conditions of the corona product between paths and second power of fan graphs to be total cordial
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.
