Prime Labelings of Some Wheel And Crown Related Graphs
![](https://ojsdergi.com/ojsicons/gor.png)
![](https://ojsdergi.com/ojsicons/pdf.png)
Keywords:
Graph Labeling, Prime Labeling, corona product, Prime GraphAbstract
A Graph G with n vertices is said to admit prime labeling if its vertices can be labeled with distinct positive integers not exceeding n such that the labels of each pair of adjacent vertices are relatively prime. A graph G which admits prime labeling is called a prime graph. In this paper we investigate the existence of prime labeling of some graphs related to wheel $W_n$ and crown $C^*_n$. We discuss prime labeling in the context of the graph operation namely corona product.
Downloads
Published
How to Cite
Issue
Section
License
![Creative Commons License](http://i.creativecommons.org/l/by-nc/4.0/88x31.png)
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.