Cordial Labeling for Swastik Graph


Abstract views: 64 / PDF downloads: 52

Authors

  • Jagruti C. Kanani Assistant Professor of Mathematics, Marwadi education foundation, Rajkot morbi road, Rajkot, Gujarat, India

Keywords:

Cordial labeling, swastik graph, path union of graphs, cycle of graphs, star of a graph

Abstract

I studied a new graph which is called swastik graph. I proved that the swastik graph is cordial. I have investigated some swastik graph related families of connected cordial graphs. I proved that path union of swastik graph, cycle of swastik graph and star of swastik graph are cordial.

Downloads

Published

15-02-2017

How to Cite

Jagruti C. Kanani. (2017). Cordial Labeling for Swastik Graph. International Journal of Mathematics And Its Applications, 5(1 - B), 129–134. Retrieved from https://ijmaa.in/index.php/ijmaa/article/view/761

Issue

Vol. 5 No. 1 - B (2017)

Section

Research Article

License

Creative Commons License

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