On SD-prime cordial graphs

Let G = (V (G),E(G)) be a simple, finite and undirected graph of order n. Given a bijection f : V (G) → {1, . . . , n}, we associate 2 integers S = f(u) + f(v) and D = |f(u) - f(v)| with every edge uv in E(G). The labeling f induces an edge labeling f' : E(G) → {0, 1} such that for any edge uv...

Full description

Bibliographic Details
Main Authors: Chu, H.-H (Author), Foo, F.-Y (Author), Lau, G.-C (Author), Ng, H.-K (Author), Suhadak, N. (Author)
Format: Article
Language:English
Published: Academic Press 2016
Subjects:
Online Access:View Fulltext in Publisher
View in Scopus