On SD-Harmonious Labeling

  • A Lourdusamy, PhD St. Xavier's College (Autonomous), Palayamkottai
  • S Jenifer Wency St. Xavier's College (Autonomous), Palayamkottai
  • F Patrick St. Xavier's College (Autonomous), Palayamkottai

Abstract

A graph G is said to be SD-harmonious labeling if there exists an injection f: V(G) -> {0,1,2,...,q} such that the induced function f*: E(G) ->{0,2,...,2q-2} defined by f(uv)=S+D (mod 2q) is bijective, where S=f(u)+f(v) and D=|f(u)-f(v)|, for every edge uv in E(G). A graph which admits SD-harmonious labeling is called SD-harmonious graph. In this paper, we investigate SD-harmonious labeling of path related graphs, tree related graphs, star related graphs and disjoint union of graphs.

Author Biographies

##submission.authorWithAffiliation##

Department of Mathematics, St. Xavier's College (Autonomous), Palayamkottai-627002, Tamilnadu,
India

##submission.authorWithAffiliation##

Department of Mathematics, Manonmaniam Sundaranar University, Tirunelveli-627012, Tamilnadu, India

##submission.authorWithAffiliation##

Department of Mathematics, St. Xavier's College (Autonomous), Palayamkottai-627002, Tamilnadu, India

Published
2018-07-01
How to Cite
LOURDUSAMY, A; WENCY, S Jenifer; PATRICK, F. On SD-Harmonious Labeling. Mapana - Journal of Sciences, [S.l.], v. 17, n. 3, july 2018. ISSN 0975-3303. Available at: <http://journals.christuniversity.in/index.php/mapana/article/view/1827>. Date accessed: 16 oct. 2018.
Section
Research Articles