Cordial Labeling for Swastik Graph
Abstract views: 27 / PDF downloads: 25
Keywords:
Cordial labeling, swastik graph, path union of graphs, cycle of graphs, star of a graphAbstract
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
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.