Cordial Labeling for Eight Sprocket Graph


Abstract views: 134 / PDF downloads: 98

Authors

  • J. C. Kanani Government Polytechnic, Rajkot, Gujarat, India
  • V. J. Kaneria Department of Mathematics, Saurashtra University, Rajkot, Gujarat, India

Keywords:

Cordial labeling, Eight Sprocket graph, Path union of graphs, Cycle of graphs, Star of a graph

Abstract

We obtained a new graph which is called Eight Sprocket graph. We proved that the Eight Sprocket graph is cordial. We have investigated some Eight Sprocket graph related families of connected cordial graphs. We proved that path union of Eight Sprocket graph, cycle of Eight Sprocket graph and star of Eight Sprocket graph are cordial.

Downloads

Published

15-03-2021

How to Cite

J. C. Kanani, & V. J. Kaneria. (2021). Cordial Labeling for Eight Sprocket Graph. International Journal of Mathematics And Its Applications, 9(1), 67–72. Retrieved from http://ijmaa.in/index.php/ijmaa/article/view/103

Issue

Vol. 9 No. 1 (2021)

Section

Research Article

License

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 > >>