Skip to main content
Log in

ON FINITE PRIME DISTANCE GRAPHS

  • Original Research
  • Published:
Indian Journal of Pure and Applied Mathematics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  1. G.Amuda, and S. Meena, Cube Difference Labeling Of Some Cyclerelated Graphs, International Journal of Innovative Science, Engineering & Technology, 2(1)(2015), 461-471.

    Google Scholar 

  2. R.B. Eggleton, P. Erdos and D.K. Skilton, Colouring prime distance graphs, Graphs and Combinatorics, 6(1990), 17–32.

    Article  MathSciNet  Google Scholar 

  3. R.B. Eggleton, P. Erdos, and D. K. Skilton, Colouring the real line, J.Combin. Theory Ser. B, 39(1) (1985), 86–100.

    Article  MathSciNet  Google Scholar 

  4. R.B. Eggleton, P. Erdos, and D. K. Skilton, Erratum: Colouring the real line J. Combin. Theory Ser. B 39 (1985), 86–100; MR0805458 (87b:05057) J. Combin. Theory Ser. B, 41(1) (1986), 139.

  5. D. Joshua Laison, Colin Starr, and Andrea Walker, Finite prime distance graphs and 2-odd graphs, Discrete Mathematics, 313(20) (2013), 2281–2291.

  6. S. Meena and K. Vaithilingam, Prime Labeling for Some Helm Related Graphs, International Journal of Innovative Research in Science, Engineering and Technology, 2(4)(2013), 1075-1085.

  7. Ronan Le Bras, Carla P. Gomes, and Bart Selman, Double-Wheel Graphs Are Graceful, Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, (2013) 587-593.

  8. K. Vaithilingam, Difference Labeling of Some Graph Families, International Journal of Mathematics and Statistics Invention (IJMSI), 2(6)(2014), 37-43.

    Google Scholar 

Download references

Acknowledgements

The authors are very much grateful for the valuable and detailed comments of the reviewer, especially in providing elegant and simplified forms of proofs of certain results. The comments have served to be very useful in improving the presentation of the paper. The first author Dr.A. Parthiban wishes to thank his wife, Mrs. Steffy Princy Parthiban for her constant help and encouragement in completing this research work.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to A. Parthiban.

Additional information

Communicated by Gadadhar Misra.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Parthiban, A., Samdanielthompson, G. & Kumar, K.S. ON FINITE PRIME DISTANCE GRAPHS. Indian J Pure Appl Math 52, 22–26 (2021). https://doi.org/10.1007/s13226-021-00135-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13226-021-00135-3

Keywords

Navigation