A NOVEL PROBLEM FOR SOLVING CORDIAL LABELING OF CORONA PRODUCT BETWEEN PATH AND THIRD ORDER OF CONE GRAPHS

Main Article Content

A. Elrokh , M. M. Ali Al-shamiri , Atef Abd El-hay

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

Download data is not yet available.

Metrics

Metrics Loading ...

Article Details

How to Cite
A. Elrokh , M. M. Ali Al-shamiri , Atef Abd El-hay. (2022). A NOVEL PROBLEM FOR SOLVING CORDIAL LABELING OF CORONA PRODUCT BETWEEN PATH AND THIRD ORDER OF CONE GRAPHS. Turkish Journal of Computer and Mathematics Education (TURCOMAT), 13(03), 970–986. https://doi.org/10.17762/turcomat.v13i03.13219
Section
Research Articles