Balanced Mean Cordial Labeling and Graph Operations
Abstract views: 33 / PDF downloads: 18
Keywords:
Path Union, Mean Cordial, Balanced mean cordialAbstract
Balanced mean cordial labeling is a mean cordial labeling $f$ with \linebreak $|v_{f}(i)- v_{f}(j)|=0$, $|e_{f}(i)- e_{f}(j)|=0$, $\forall$ $i,j\in \{0,1,2\}$. In this paper, we investigate mean cordial labeling for P($t\cdot H$), where H be any graph and $t\equiv 0$(mod $3$). We also investigate balanced mean cordial labeling for TP($t\cdot H$), G$^{*}$, P$_{t}$$\times G$, C$_{t}$$\times G$, where H and G both are balanced cordial graphs.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2023 International Journal of Mathematics And its Applications
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.