Some result on balanced Cordial graphs


Abstract views: 49 / PDF downloads: 14

Authors

  • V. J. Kaneria Department of Mathematics, Saurashtra University, Rajkot, India
  • J. R. Teraiya Department of Mathematics, Marwadi Engineering college, Rajkot, India
  • K. M. Patadiya Department of Mathematics, School of Engineering, RK University, Rajkot, India

Keywords:

Balanced cordial labeling, cycle of graph, star of graph, path of graph

Abstract

In this paper we have prove that $P(t \cdot C_{4n})$, $ C(t \cdot C_{4n})$ and $C_{4n}^ {\ast} $ are balanced cordial graphs under certain condition. A balanced cordial graph is a cordial graph and it satisfies $ \vert v_{f}(0) - v_{f}(1) \vert = 0 = \vert e_{f}(0)- e_{f}(1) \vert $ condition.

 

 

Author Biographies

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

 

 

J. R. Teraiya, Department of Mathematics, Marwadi Engineering college, Rajkot, India

 

 

K. M. Patadiya, Department of Mathematics, School of Engineering, RK University, Rajkot, India

 

 

Downloads

Published

01-05-2016

How to Cite

V. J. Kaneria, J. R. Teraiya, & K. M. Patadiya. (2016). Some result on balanced Cordial graphs. International Journal of Mathematics And Its Applications, 4(2 - A), 85–87. Retrieved from http://ijmaa.in/index.php/ijmaa/article/view/1009

Issue

Vol. 4 No. 2 - A (2016)

Section

Research Article

License

Copyright (c) 2023 International Journal of Mathematics And its Applications

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

Most read articles by the same author(s)

1 2 > >>