ON FINITE PRIME DISTANCE GRAPHS

A. Parthiban (), G. Samdanielthompson () and K. Sathish Kumar ()
Additional contact information
A. Parthiban: Lovely Professional University
G. Samdanielthompson: Hindustan College of Arts and Science
K. Sathish Kumar: Madras Christian College

Indian Journal of Pure and Applied Mathematics, 2021, vol. 52, issue 1, 22-26

Abstract: Abstract A graph G is a prime distance graph if its vertices can be labeled with distinct integers such that for any two adjacent vertices, the difference of their labels is a prime number. It is known that cycles and bipartite graphs are prime distance graphs. In this paper we derive some general results concerning prime distance labeling of graphs and also establish interesting results for complete graphs, wheel graphs, and wheel-related graphs.

Keywords: Distance Graphs; Prime Distance Graphs; Prime Distance Labeling; Finite Prime Distance Graphs (search for similar items in EconPapers)
Date: 2021
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s13226-021-00135-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:indpam:v:52:y:2021:i:1:d:10.1007_s13226-021-00135-3

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/13226

DOI: 10.1007/s13226-021-00135-3

Access Statistics for this article

Indian Journal of Pure and Applied Mathematics is currently edited by Nidhi Chandhoke

More articles in Indian Journal of Pure and Applied Mathematics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().