Prime labeling of line and splitting graph of brush graph
F Fran, DR Putra, M Pasaribu - Journal of Physics: Conference …, 2021 - iopscience.iop.org
A bijective function f from V (G) to {1, 2,..., n} be a prime labeling of a graph G with n order if
for every u, v∈ V (G) such that e= uv∈ E (G), f (u) and f (v) relatively prime. A prime graph is …
for every u, v∈ V (G) such that e= uv∈ E (G), f (u) and f (v) relatively prime. A prime graph is …