On prime distance labeling of graphs

descriptionPublicationkeyboard_double_arrow_right Article , Other literature type 01 Aug 2017Publisher:IEEEJournal:2017 International Conference On Smart Technologies For Smart Nation (SmartTechCon)

Authors: V. Yegnanarayanan;

doi: 10.1109/smarttechcon.2017.8358629

On prime distance labeling of graphs

- Summary
- Metrics

Abstract

According to J.D. Laison, C. Starr and A. Walker a graph G is a prime distance garph if there exists a 1-1 labeling f : V(G) → Ζ such that for any two adjacent vertices u and ν the integer |f(u)-f(v)| is a prime. Further they called such a labelling of V(G) a prime distance labelling (PDL) of G. In this paper we prove certain existence and non-existence results concerning PDL. We also discuss certain applications besides raising some open problems.

Related Organizations

SASTRA University
India

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	0
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average

Found an issue? Give us feedback

0

Average

Upload OA version

Are you the author of this publication? Upload your Open Access version to Zenodo!

It’s fast and easy, just two clicks!

uploadUpload now