Balanced V4 - Cordial graph and its application to Produce new V4 - Cordial Families

Authors

  • V. J. Kaneria ( Department of Mathematics, Saurashtra University, Rajkot, India )
  • Kalpesh M. Patadiya 2 ( School of Engineering, RK University, Rajkot,India )

Keywords:

Binary vertex labeling, balanced cordial graph, corona graph. AMS Subject Classification number: 05C78.

Abstract

In this paper we introduce a balanced V4 - cordial labeling for a graph G. We proved that ???????? × ????8????
, ???????? ×
????8????
, are balanced V4 - cordial. We also proved that the corona graph????1 ⊙ ????2
is V4 - cordial, when ????1
is V4 - cordial
and ????2
is balanced V4 - cordial.

Downloads

Published

2017-03-25

How to Cite

V. J. Kaneria, & Kalpesh M. Patadiya 2. (2017). Balanced V4 - Cordial graph and its application to Produce new V4 - Cordial Families. International Journal of Advance Engineering and Research Development (IJAERD), 4(3), 132–136. Retrieved from https://ijaerd.org/index.php/IJAERD/article/view/1972

Issue

Vol. 4 No. 3 (2017): Volume 4 Issue 3 March 2017

Section

Articles