Prime Labeling of Union of Some Graphs
A prime labeling of a graph G is a map from the vertex set of G to the set {1, 2, ..., |V (G)|} such that any two adjacent vertices in the graph G have labels that are relatively prime. In this paper, we discuss when the disjoint union of some graphs is a prime graph.
Authors
- Omar A. AbuGhneim (ORCID: https://orcid.org/0000-0001-9080-0260)
- Baha’ Abughazaleh (ORCID: https://orcid.org/0000-0002-7188-9180)
Institutions
- University of Jordan (JO)
Publication Details
- Journal
- European Journal of Pure and Applied Mathematics
- Published
- 2024-10-31
- DOI
- https://doi.org/10.29020/nybg.ejpam.v17i4.5336
- Citations
- 1
- Primary Topic
- Graph Labeling and Dimension Problems
- Type
- article
- Field-Weighted Citation Impact
- 0.36