Prime labeling of graphs constructed from wheel graph
A prime labeling of a simple undirected graph G is to assign unique integer labels from the set {1,2,...,|V(G)|} to each vertex such that any two adjacent vertices in the graph have labels that are relatively prime. Studying prime labeling in graphs can help us understand the structure and propertie...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2024-01-01
|
| Series: | Heliyon |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S2405844024000100 |