The Radio Dd-Distance in Harmonic Mean
Number of Some New Graphs

K. John Bosco; B.S. Vishnupriya

doi:https://doi.org/10.14445/22315373/IJMTT-V67I2P517

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 67 | Issue 2 | Year 2021 | Article Id. IJMTT-V67I2P517 | DOI : https://doi.org/10.14445/22315373/IJMTT-V67I2P517

The Radio Dd-Distance in Harmonic Mean Number of Some New Graphs

K. John Bosco, B.S. Vishnupriya

Citation :

K. John Bosco, B.S. Vishnupriya, "The Radio Dd-Distance in Harmonic Mean Number of Some New Graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 67, no. 2, pp. 121-123, 2021. Crossref, https://doi.org/10.14445/22315373/IJMTT-V67I2P517

Abstract

A radio Dd-distance in harmonic mean labelling of a connected graph 𝐺 is an injective map 𝑓 from the vertex set 𝑉(𝐺) to the ℕ such that for two distinct vertices 𝑢 and 𝑣 of 𝐺, 𝐷 𝐷𝑑(𝑢, 𝑣) + ⌈ 2𝑓(𝑢)𝑓(𝑣) 𝑓(𝑢)+𝑓(𝑣) ⌉ ≥ 𝑑𝑖𝑎𝑚𝐷𝑑(𝐺) + 1. where 𝐷 𝐷𝑑(𝑢, 𝑣) denote Dd-distance between 𝑢 and 𝑣 𝑑𝑖𝑎𝑚𝐷𝑑(𝐺) denotes the diameter of 𝐺. The radio Dd-distance in harmonic mean number of 𝑓, 𝑟ℎ 𝐷𝑑𝑛(𝑓) is the maximum label assigned to any vertex of 𝐺. The radio Dd-distance in harmonic mean number of 𝐺, 𝑟ℎ 𝐷𝑑𝑛(𝐺) is the minimum value of of 𝐺. In the paper we find the radio Dd-distance in harmonic mean number of some standard graphs.

Keywords

Dd-distance, Radio harmonic mean number, Radio Dd-distance in harmonic mean number.

References

[1] Amuthavalli.K and Dineshkumar.S, Radio odd mean number of complete graphs. International Journal of Pure and Applied mathematics, 113(7)(2017) 8-15.
[2] Chartrand.G, Erwin.D, Zhang.P and Harary.F, Radio labeling of graphs, Bull. Inst. Combin. Appl.33 (2001) 77 – 85.
[3] Chartrand.G, Erwin.D and Zhang.P, A graph labeling problem suggested by FM channel restrictions, Bull. Inst. Combin. Appl. 43(2005) 43-57
[4] Gallian J.A, A dynamic survey of graph labeling, Electron. J. Combin. 19 (2012) #DS6.
[5] Hale W.K, Frequency assignment: theory and applications, Proc. IEEE 68(1980) 1497-1514.
[6] Harary.F, Graph Theory, Addison Wesley, New Delhi (1969).
[7] HemalathaV, Mohanaselvi.V and Amuthavall .K, Radio Geometric mean Labeling of Some Star like Graphs, Journal of Informatics and Mathematical Sciences, 9(3)(2017) 969-977.
[8] Ponraj.R, Sathish Narayanan.S and Kala.R, Radio mean labeling of a graph, AKCE International Journal of Graphs and Combinatorics 12 (2015) 224 –228.
[9] Ponraj.R, Sathish Narayanan.S and Kala.R, On radio mean number of graphs, International J.Math. Combin. 3 (2014) 41 – 48.
[10] K.JohnBosco and B S Vishnupriya , Radio Dd-distance number of some subgraphs communicated
[11] JohnBosco and B S Vishnupriya , Radio Dd-distance number of some standard graphs. IJRAR (2021).