Skip to main content

Consecutive Radio Labelling of Graphs

  • Conference paper
  • First Online:
Data Science and Security

Part of the book series: Lecture Notes in Networks and Systems ((LNNS,volume 290))

Abstract

Radio labelling or radio colouring is an assignment of positive integers to the vertices of a graph such that the difference between labels of any two vertices must be at least one more than the difference between the diameter of the graph and the distance between the vertices themselves. A graph G admits consecutive radio labelling when the radio number of the graph equals the order of the graph. In this paper, we study certain graphs admitting consecutive radio labelling and identify certain properties of such graphs. Moreover, we characterize the graphs with diameter two admitting consecutive radio labelling and examine certain properties of the labelling under some graph operations.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Buckley F (1989) Self-centred graphs. Ann N Y Acad Sci 576(1):71–78

    Article  Google Scholar 

  2. Chartrand G, Erwin D, Zhang P (2005) A graph labelling problem suggested by FM channel restrictions. Bull Inst Combin Appl 43:43–57

    MathSciNet  MATH  Google Scholar 

  3. Fernandez C, Flores A, Tomova M, Wyels C (2008) The radio number of gear graphs. arXiv preprint arXiv:0809.2623

  4. Hale WK (1980) Frequency assignment: theory and applications. Proc IEEE 68(12):1497–1514

    Article  Google Scholar 

  5. Liu DD-F (2008) Radio number for trees. Discret Math 308(7):1153–1164

    Article  MathSciNet  Google Scholar 

  6. Liu DD-F, Xie M (2004) Radio number for square of cycles. Congr Numer 169:105–125

    MathSciNet  Google Scholar 

  7. Liu DD-F, Xie M (2009) Radio number for square paths. ARS Combin 90:307–319

    MathSciNet  MATH  Google Scholar 

  8. Liu DD-F, Zhu X (2005) Multilevel distance labellings for paths and cycles. SIAM J Discret Math 19(3):610–621

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Joseph Varghese Kureethara .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Raj, A.T., Kureethara, J.V. (2021). Consecutive Radio Labelling of Graphs. In: Shukla, S., Unal, A., Kureethara, J.V., Mishra, D.K., Han, D.S. (eds) Data Science and Security. Lecture Notes in Networks and Systems, vol 290. Springer, Singapore. https://doi.org/10.1007/978-981-16-4486-3_35

Download citation

Publish with us

Policies and ethics