Balanced Mean Cordial Labeling and Graph Operations


Abstract views: 33 / PDF downloads: 18

Authors

  • V. J. Kaneria Department of Mathematics, Saurashtra University, Rajkot, Gujarat, India
  • M. J. Khoda Department of Mathematics, VVP Engineering College, Virda Vajadi, Rajkot, Gujarat, India
  • H. M. Karavadiya Department of Mathematics, VVP Engineering College, Virda Vajadi, Rajkot, Gujarat, India

Keywords:

Path Union, Mean Cordial, Balanced mean cordial

Abstract

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.

 

 

Author Biographies

V. J. Kaneria, Department of Mathematics, Saurashtra University, Rajkot, Gujarat, India

 

 

M. J. Khoda, Department of Mathematics, VVP Engineering College, Virda Vajadi, Rajkot, Gujarat, India

 

 

H. M. Karavadiya, Department of Mathematics, VVP Engineering College, Virda Vajadi, Rajkot, Gujarat, India

 

 

Downloads

Published

01-09-2016

How to Cite

V. J. Kaneria, M. J. Khoda, & H. M. Karavadiya. (2016). Balanced Mean Cordial Labeling and Graph Operations. International Journal of Mathematics And Its Applications, 4(3 - A), 181–184. Retrieved from http://ijmaa.in/index.php/ijmaa/article/view/983

Issue

Section

Research Article

Most read articles by the same author(s)

1 2 > >>