Some graph operations on sum divisor cordial labeling related to H- graph
Abstract
A sum divisor cordial labeling of a graph with vertex set is a bijection such that each edge uv assigned the label 1 if 2 divides and 0 otherwise. Further, the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. A graph with a sum divisor cordial labeling is called a sum divisor cordial graph. In this paper, we prove that graphs ( is even), duplication of all edges of - graph ( is even),,, are sum divisor cordial graphs.
Cited by 2
From OpenAlex, OpenCitations and reference lists read by Scinovex
- Extended results on sum divisor cordial labeling ↗
Arunachalam Sugumaran, K. Rajesh · Proyecciones (Antofagasta) · 2019
A sum divisor cordial labeling of a graph G with vertex set V (G) is a bijection f : V (G) → {1, 2, ..., |V (G)|} such that an edge uv assigned the label 1 if 2 divides f(u)+f(v) and 0 otherwise. Further the number of edges labeled with 0 and the the number of edges labeled with 1…
❝ 1PDF - Sum Divisor Cordial Labeling of T p -Tree Related Graphs ↗
Arockiam Lourdusamy, S. Jenifer Wency, F. Patrick · Ars Combinatoria · 2023
A sum divisor cordial labeling of a graph G with vertex set V ( G ) is a bijection f from V ( G ) to { 1 , 2 , ⋯ , | V ( G ) | } such that an edge u v is assigned the label 1 if 2 divides f ( u ) + f…
❝ 0PDF
How this paper connects to the literature. Drag to explore, click any node to open that paper.