Total cordial labeling of corona product of paths and second power of fan graph

Main Article Content

Atef Abd El-hay
Ashraf Elrokh

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

Download data is not yet available.

Metrics

Metrics Loading ...

Article Details

How to Cite
El-hay, A. A. ., & Elrokh, A. . (2022). Total cordial labeling of corona product of paths and second power of fan graph. Turkish Journal of Computer and Mathematics Education (TURCOMAT), 13(03), 681–690. https://doi.org/10.17762/turcomat.v13i03.13097
Section
Research Articles