Year: 2024
Type: article
Abstract: 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, Baha' Abughazaleh
Institutions: University of Jordan, Isra University, Isra University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W4403934313