Prime Labeling of Union of Some Graphs

Authors

DOI:

https://doi.org/10.29020/nybg.ejpam.v17i4.5336

Keywords:

Independence number, Wheels, Prime labeling, Prime graphs

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.

Downloads

Published

2024-10-31

Issue

Section

Nonlinear Analysis

How to Cite

Prime Labeling of Union of Some Graphs. (2024). European Journal of Pure and Applied Mathematics, 17(4), 3557-3566. https://doi.org/10.29020/nybg.ejpam.v17i4.5336