Abstract
The necessity for good and tenable communication systems has motivated researchers to develop mobile communication networks (MCN). On the other hand, the huge functionalities of the global system of mobile (GSM) communication have given an increasing number of users. As the subscribers grow, the necessity for efficient and productive planning of the limited frequency spectrum of the GSM is inevitable, especially in highly dense areas. Researchers have proposed various algorithms for frequency or channel allocation (CA), as the discussions about CA methods to resolve the various practical issues in CA are going on. The literature reveals that the “Manhattan distance” concept can be used in scheduling and optimization problems. Similarly, the same idea makes it possible to discover a more tenable telecommunication system with “ease of connectivity” among subscribers, even when many users are on a common channel. Graph labeling is the most interesting idea in graph theory that has numerous uses in different fields, particularly in communication networks. 2-odd labeling assigns distinct integers to the nodes of a graph \(G\left( {V,E} \right)\) such that the positive difference of adjacent nodes is either 2 or an odd integer, \(2k \pm 1,\;k \in N\). The motivation behind the development of this article is to study the applications of graph theory in communication networks through the concept of 2-odd labeling in graphs.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Acharya BD, Arumugam S, Rosa A (2008) Labeling of discrete structures and applications. Narosa Publishing House, New Delhi
Bloom GS, Glomb SW (1977) Application of numbered undirected graphs. Proc IEEE 65:562–570
Gross J, Yellen J (1999) Graph theory and its applications. CRC Press, London
Prasanna NL (2014) Applications of graph labeling in communication networks. Int Res J Comp Sci Technol 7(1)
West DB (2000) Introduction to graph theory, 2nd edn. Prentice-Hall, Englewood Cliffs, NJ
Abirami P, Parthiban A, Srinivasan N (2020) On 2-odd labeling of graphs. Eur J Mole Clin Med 07:3914–3918
Laison JD, Starr C, Walker A (2013) Finite prime distance graphs and 2-odd graphs. Discret Math 313:2281–2291
Parthiban A, Gnanamalar David N (2017) On prime distance labeling of graphs. In: Arumugam S, Bagga J, Beineke L, Panda B (eds) Theoretical computer science and discrete mathematics. ICTCSDM 2016. Lecture notes in computer science 10398. Springer, Cham, vol 31, pp 238–241
Parthiban A, Pir AA, Felix A (2020) Certain results on prime and prime distance labeling of graphs. J Phys Conf Ser 1531:012062, 1–6
Gallian JA (2014) Graph labeling. Electron J Combin (Dyn Surv DS6) 17
Parthiban A, Samdanielthompson G, Kumar KS (2021) On finite prime distance graphs. Indian J Pure Appl Math 52:22–26
Meena S, Vaithilingam K (2013) Prime labeling for some helm-related graphs. Int J Inno Res Sci Eng Technol 2(4):1075–1085
Vaithilingam K (2014) Difference labeling of some graph families. Int J Math Statistics Invention (IJMSI) 2(6):37–43
Wahyuna HD, Indriati D (2018) On the total edge irregularity strength of generalized butterfly graph. J Phys Conf Ser 1008:1–6
Sampathkumar E (1980) Walikar: on the splitting graph of a graph. The Karnataka Univ J Sci 25:13–16
Kodheli O et al (2020) Satellite communications in the new space era: a survey and future challenges. IEEE Commun Surv Tutorials (DRAFT) 2:1–45
Tosuni B (2015) Graph coloring problems in modern computer science. Eur J Interdiscip Stud 01(2):87–95
Leighton FT (1979) A graph coloring algorithm for large scheduling problems. J Res Natl Bureau Standard 84:79–100
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Pir, A.A., Mushtaq, T., Parthiban, A. (2023). Studying the Applications of Graph Labeling in Satellite Communication Through 2-Odd Labeling of Graphs. In: Singh, D., Chaudhary, R.K., Dev Kumar, K. (eds) Computer Aided Constellation Management and Communication Satellites. Lecture Notes in Electrical Engineering, vol 987. Springer, Singapore. https://doi.org/10.1007/978-981-19-8555-3_6
Download citation
DOI: https://doi.org/10.1007/978-981-19-8555-3_6
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-19-8554-6
Online ISBN: 978-981-19-8555-3
eBook Packages: EngineeringEngineering (R0)