IDEAS home Printed from https://ideas.repec.org/a/spr/indpam/v52y2021i1d10.1007_s13226-021-00135-3.html
   My bibliography  Save this article

On Finite Prime Distance Graphs

Author

Listed:
  • A. Parthiban

    (Lovely Professional University)

  • G. Samdanielthompson

    (Hindustan College of Arts and Science)

  • K. Sathish Kumar

    (Madras Christian College)

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.

Suggested Citation

  • A. Parthiban & G. Samdanielthompson & K. Sathish Kumar, 2021. "On Finite Prime Distance Graphs," Indian Journal of Pure and Applied Mathematics, Springer, vol. 52(1), pages 22-26, March.
    • Handle: RePEc:spr:indpam:v:52:y:2021:i:1:d:10.1007_s13226-021-00135-3
    DOI: 10.1007/s13226-021-00135-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13226-021-00135-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s13226-021-00135-3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:indpam:v:52:y:2021:i:1:d:10.1007_s13226-021-00135-3. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.