Prime Labeling of Union of Some Graphs

Omar A. AbuGhneim, Baha' Abughazaleh

Source record

Source: Crossref

Published: Oct 31, 2024

DOI: 10.29020/nybg.ejpam.v17i4.5336

Open original source ↗

Source 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.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.