On SD-prime labelings of some one point unions of gears

Let G = (V(G), E(G)) be a simple, finite and undirected graph of order n. Given a bijection f: V(G) → {1, …, n}, and every edge uv in E(G), let S = f (u) + f (v) and D = | f (u) − f (v)|. The labeling f induces an edge labeling f′: E(G) → {0, 1} such that for an edge uv in E(G), f′ (uv) = 1 if gcd(S...

Full description

Bibliographic Details
Main Authors: Lau, G.-C (Author), Shiu, W.-C (Author)
Format: Article
Language:English
Published: MDPI AG 2021
Series:Symmetry
Subjects:
Online Access:View Fulltext in Publisher
View in Scopus