Combinatorics and Graph Theory


Difference Cordial Labeling of the Graphs Related to Duplication of an Edge or Vertex of a Cycle and Total Graph

Authors: A. Sugumaran, V. Mohan

Abstract. A difference cordial labeling of a graph G is a bijective function f from V(G) onto {1, 2, 3, ⋯ , |V(G)|} such that each edge uv is assigned the label 1 if |f(u) – f(v)| = 1, and the label 0 otherwise, satisfying the condition that the number of edges labeled with 1 and the number of edges labeled with 0 differ by at most 1. A graph with difference cordial labeling is called a difference cordial graph. In this paper we proved that the umbrella graph U(m, n), duplication of a vertex by an edge in a cycle Cn, duplication of an edge by a vertex in a cycle Cn and the total graph of a path Pn are difference cordial graphs.

Comments: 13 Pages.

Download: PDF

Submission history

[v1] 2019-07-18 12:55:28

Unique-IP document downloads: 17 times is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus