A NOVEL PROBLEM FOR SOLVING CORDIAL LABELING OF CORONA PRODUCT BETWEEN PATH AND THIRD ORDER OF CONE GRAPHS
Main Article Content
Abstract
A simple graph is said to be cordial if it admits 0-1 labeling that satisfies certain conditions. In this paper we investigate necessary and sufficient conditions for cordial labeling of the corona Product between path and third order of cone graphs
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.
