International Journal of Mathematics and Computer

Applications Research (IJMCAR)

ISSN (P): 2249–6955; ISSN (E): 2249–8060
Vol. 11, Issue 1, Jun 2021, 43-48
© TJPRC Pvt. Ltd

ON RADIO D-DISTANCE IN HARMONIC MEAN LABELLING OF SOME GRAPHS

K JOHN BOSCO1 & B S VISHNUPRIYA2

1
Assistant Professor, Department of Mathematics St.Jude’s College Thoothoor
2
Research scholar Department of Mathematics St.Jude’s College Thoothoor
ABSTRACT

A radio harmonic mean D-distance labelling of a connect graph 𝑮 is an injective map 𝒇 from the vertex set 𝑽(𝑮) to the
𝟐𝒇(𝒖)𝒇(𝒗)
𝑵 such that for two distinct vertices 𝒖 and 𝒗 of 𝑮, 𝒅𝑫 (𝒖, 𝒗) + ⌈ ⌉ ≥ 𝒅𝒊𝒂𝒎𝑫 (𝑮) + 𝟏 . The radio D-distance
𝒇(𝒖)+𝒇(𝒗)

harmonic mean number of 𝒇, 𝒓𝒉𝑫 𝒏(𝒇) is the maximum number assigned to any vertex of 𝑮 .
KEYWORDS: D-distance, Radio harmonic mean number & Radio D-distance in harmonic mean number

Received: Feb 03, 2020; Accepted: Feb 23, 2021; Published: Mar 24, 2021; Paper Id.: IJMCARJUN20215

INTRODUCTION

Original Article
A graph 𝐺 = (𝑉, 𝐸) we mean a finite undirected graph without loops or multiple edges. The order and size of 𝐺 are
denoted by 𝑝 and 𝑞 respectively. Graph labelling was introduced by Alexander Rosa in 1967. Radio mean labelling
was introduced by S.Somasundaram and R.Ponraj in 2004. Harmonic mean labelling was introduced by
S.Somasundaram and S.S.Sandhya in 2012.

Theorem: 1.1

The radio D-distance in harmonic mean number of comb graph of 𝑟ℎ𝐷 𝑛(𝑃𝑛 ⨀𝐾1 ) ≤ 5𝑛 − 2.

Proof:

Let (𝑃𝑛 ⨀𝐾1 ) = {𝑣𝑖 , 𝑢𝑖 /𝑖 = 1,2, … , 𝑛} 𝐸 = {𝑣𝑖 𝑣𝑖+1 , 𝑣𝑖 𝑢𝑖 𝑖 = 1,2, … , 𝑛}. 𝑉(𝑃𝑛 ⨀𝐾1 ) be the vertex set. let
𝑑𝑖𝑎𝑚𝐷 (𝑃𝑛 ⨀𝐾1) = 4𝑛 + 1.

Using radio d distance in harmonic mean condition

2𝑓(𝑣1 )𝑓(𝑢1 )
𝑑𝐷 (𝑣1 , 𝑢1 ) + ⌈ ⌉ ≥ 4𝑛 + 2.
𝑓(𝑣1 )+𝑓(𝑢1 )

2𝑓(𝑣1 )𝑓(𝑢1 )
⌈ ⌉ ≥ 4𝑛 − 2
𝑓(𝑣1 )+𝑓(𝑢1 )

2𝑓(𝑣2 )𝑓(𝑢2 )
𝑑𝐷 (𝑣2 , 𝑢2 ) + ⌈𝑓(𝑣 ⌉ ≥ 4𝑛 + 2.
2 )+𝑓(𝑢2 )

2𝑓(𝑣1 )𝑓(𝑢2 )
⌈ ⌉ ≥ 4𝑛 − 3.
𝑓(𝑣1 )+𝑓(𝑢2 )

2𝑓(𝑣𝑖+1 )𝑓(𝑢𝑖+1 )
𝑑𝐷 (𝑣𝑖+1 , 𝑢𝑖+1 ) + ⌈ ⌉ ≥ 4𝑛 + 2.
𝑓(𝑣𝑖+1 )+𝑓(𝑢𝑖+1 )

2𝑓(𝑣𝑖+1 )𝑓(𝑢𝑖+1 )
⌈ ⌉ ≥ 4𝑛 − 3. 𝑖 = 1,2, … , 𝑛 − 1.
𝑓(𝑣𝑖+1 )+𝑓(𝑢𝑖+1 )

www.tjprc.org editor@tjprc.org
44 K John Bosco & B S Vishnupriya

2𝑓(𝑣𝑖+1 )𝑓(𝑣𝑖+2 )
𝑑𝐷 (𝑣𝑖+1 , 𝑣𝑖+2 ) + ⌈𝑓(𝑣 ⌉ ≥ 4𝑛 + 2.
𝑖+1 )+𝑓(𝑣𝑖+2 )

2𝑓(𝑣𝑖+1 )𝑓(𝑣𝑖+2 )
⌈ ⌉ ≥ 4𝑛 − 5. 𝑖 = 1,2, … , 𝑛 − 1.
𝑓(𝑣𝑖+1 )+𝑓(𝑣𝑖+2 )

Hence the radio D-distance in harmonic mean number of comb graph of

𝑟ℎ𝐷 𝑛(𝑃𝑛 ⨀𝐾1 ) ≤ 5𝑛 − 2.

Theorem:1.2

The radio D-distance in harmonic mean number of ladder graph of 𝑟ℎ𝐷 𝑛(𝐿𝑛 ) ≤ 5𝑛 − 4. 𝑛 ≥ 3.

Proof:

Let 𝑉(𝐿𝑛 ) = {𝑣1 , 𝑣2 , … , 𝑣2𝑛 } and = {𝑣𝑖 𝑣𝑗 /𝑖, 𝑗 = 1,2, … , 𝑛} . let 𝑑𝑖𝑎𝑚𝐷 (𝐿𝑛 ) = 4𝑛.

Using radio d distance in harmonic mean condition

2𝑓(𝑣1 )𝑓(𝑣2 )
𝑑𝐷 (𝑣1 , 𝑣2) + ⌈𝑓(𝑣 ⌉ ≥ 4𝑛 + 1.
1 )+𝑓(𝑣2 )

2𝑓(𝑣1 )𝑓(𝑣2 )
⌈ ⌉ ≥ 4𝑛 − 4.
𝑓(𝑣1 )+𝑓(𝑣2 )

2𝑓(𝑣3 )𝑓(𝑣4 )
𝑑𝐷 (𝑣3 , 𝑣4 ) + ⌈ ⌉ ≥ 4𝑛 + 1
𝑓(𝑣3 )+𝑓(𝑣4 )

2𝑓(𝑣2𝑖+1 )𝑓(𝑣2𝑖+2 )
𝑑𝐷 (𝑣2𝑖+1 , 𝑣2𝑖+2 ) + ⌈ ⌉ ≥ 4𝑛 + 1.
𝑓(𝑣2𝑖+1 )+𝑓(𝑣2𝑖+2 )

2𝑓(𝑣2𝑖+1 )𝑓(𝑣2𝑖+2 )
⌈ ⌉ ≥ 4𝑛 − 6. 𝑖 = 1,2, … , 𝑛 − 1.
𝑓(𝑣2𝑖+1 )+𝑓(𝑣2𝑖+2 )

2𝑓(𝑣2𝑖+1 )𝑓(𝑣2𝑖+3 )
𝑑𝐷 (𝑣2𝑖+1 , 𝑣2𝑖+3 ) + ⌈𝑓(𝑣 ⌉ ≥ 4𝑛 + 1.
2𝑖+1 )+𝑓(𝑣2𝑖+3 )

2𝑓(𝑣2𝑖+1 )𝑓(𝑣2𝑖+3 )
⌈ ⌉ ≥ 4𝑛 − 6. 𝑖 = 1,2, … ,2𝑛 − 1.
𝑓(𝑣2𝑖+1 )+𝑓(𝑣2𝑖+3 )

2𝑓(𝑣2𝑖 )𝑓(𝑣2𝑖+2 )
𝑑𝐷 (𝑣2𝑖 , 𝑣2𝑖+2 ) + ⌈𝑓(𝑣 ⌉ ≥ 4𝑛 + 1.
2𝑖 )+𝑓(𝑣2𝑖+2 )

2𝑓(𝑣2𝑖 )𝑓(𝑣2𝑖+2 )
⌈ ⌉ ≥ 4𝑛 − 6. 𝑖 = 1,2, … ,2𝑛.
𝑓(𝑣2𝑖 )+𝑓(𝑣2𝑖+2 )

Hence 𝑟ℎ𝐷 𝑛(𝐿𝑛 ) ≤ 5𝑛 − 4. 𝑛 ≥ 3.

Impact Factor (JCC): 7.3195 NAAS Rating: 3.76

On Radio D-Distance in Harmonic Mean Labelling of Some Graphs 45

Theorem: 1.3

The radio D-distance in harmonic mean number of double fan graph of 𝑟ℎ𝐷 𝑛(𝐷(𝐹𝑛 )) ≤
𝑛 + 1, 𝑖𝑓 𝑛 = 4,5
{ .
2(𝑛 + 1), 𝑖𝑓 𝑛 = 3 𝑎𝑛𝑑 𝑛 ≥ 6

Proof:

Let 𝑉(𝐷(𝐹𝑛 )) = {𝑣𝑖 𝑣𝑗 𝑖 = 1,2 𝑎𝑛𝑑 𝑗 = 1,2, . . , 𝑛} and (𝐷(𝐹𝑛 )) = {𝑣𝑖 𝑢𝑗 , 𝑢𝑗 𝑢𝑗+1 /𝑖 = 1,2 𝑎𝑛𝑑𝑗 = 1,2, … , 𝑛} .
let 𝑑𝑖𝑎𝑚𝐷 (𝐷(𝐹𝑛 )) = 4𝑛.

Using radio d distance in harmonic mean condition

2𝑓(𝑣1 )𝑓(𝑢1 )
𝑑𝐷 (𝑣1 , 𝑢1 ) + ⌈ ⌉ ≥ 2𝑛 + 6.
𝑓(𝑣1 )+𝑓(𝑢1 )

2𝑓(𝑣1 )𝑓(𝑢1 )
1+𝑛+3+⌈ ⌉ ≥ 2𝑛 + 6
𝑓(𝑣1 )+𝑓(𝑢1 )

2𝑓(𝑣 )𝑓(𝑢 )
𝑑𝐷 (𝑣𝑖 , 𝑢𝑖 ) + ⌈𝑓(𝑣 )+𝑓(𝑢
𝑖 𝑖
)
⌉ ≥ 2𝑛 + 6.
𝑖 𝑖

2𝑓(𝑣𝑖 )𝑓(𝑢𝑖)
⌈ ⌉ ≥ 𝑛 + 2. 𝑖 = 1,2. 𝑗=1
𝑓(𝑣𝑖 )+𝑓(𝑢𝑖)

2𝑓(𝑢2 )𝑓(𝑢3 )
𝑑𝐷 (𝑢2 , 𝑢3 ) + ⌈𝑓(𝑢 ⌉ ≥ 2𝑛 + 6.
2 )+𝑓(𝑢3 )

2𝑓(𝑢𝑖+1 )𝑓(𝑢𝑖+2 )
𝑑𝐷 (𝑢𝑖+1 , 𝑢𝑖+2 ) + ⌈𝑓(𝑢 ⌉ ≥ 2𝑛 + 6.
𝑖+1 )+𝑓(𝑢𝑖+2 )

2𝑓(𝑢𝑖+1 )𝑓(𝑢𝑖+2 )
⌈ ⌉ ≥ 2𝑛 − 3. 𝑖 = 1,2, … , 𝑛 − 1.
𝑓(𝑢𝑖+1 )+𝑓(𝑢𝑖+2 )

𝑛 + 1, 𝑖𝑓 𝑛 = 4,5
Hence the 𝑟ℎ𝐷 𝑛(𝐷(𝐹𝑛 )) ≤ { .
2(𝑛 + 1), 𝑖𝑓 𝑛 = 3 𝑎𝑛𝑑 𝑛 ≥ 6

Theorem:1.4

The radio D-distance in harmonic mean number of gear graph of 𝑟ℎ𝐷 𝑛(𝐺𝑛 ) ≤ 2𝑛 + 10, 𝑛 ≥ 6.

Proof:

Let {𝑣0 , 𝑣1 , … . , 𝑣𝑛 } and {𝑢1 , 𝑢2 , … , 𝑢𝑛 }, where 𝑣0 is the central vertex and 𝐸(𝐺𝑛 ) = {𝑣0𝑣𝑖 , 𝑣𝑖 𝑢𝑖 /𝑖 = 1,2, … , 𝑛}. Let
𝑑𝑖𝑎𝑚𝐷 (𝐺𝑛 ) = 𝑛 + 14.

Using radio d distance in harmonic mean condition

2𝑓(𝑣0 )𝑓(𝑣𝑖 )
𝑑𝐷 (𝑣0 , 𝑣𝑖 ) + ⌈𝑓(𝑣 ⌉ ≥ 𝑛 + 15.
0 )+𝑓(𝑣𝑖 )

2𝑓(𝑣0 )𝑓(𝑣𝑖 )
⌈ ⌉ ≥ 11 𝑖 = 1,2, … , 𝑛.
𝑓(𝑣0 )+𝑓(𝑣𝑖 )

2𝑓(𝑣 )𝑓(𝑢 )
𝑑𝐷 (𝑣𝑖 , 𝑢𝑖 ) + ⌈𝑓(𝑣 )+𝑓(𝑢
𝑖 𝑖
)
⌉ ≥ 𝑛 + 15.
𝑖 𝑖

2𝑓(𝑣𝑖 )𝑓(𝑢𝑖 )
⌈ ⌉ ≥ 𝑛 + 9.
𝑓(𝑣𝑖 )+𝑓(𝑢𝑖 )

www.tjprc.org editor@tjprc.org
46 K John Bosco & B S Vishnupriya

Hence 𝑟ℎ𝐷 𝑛(𝐺𝑛 ) ≤ 2𝑛 + 10, 𝑛 ≥ 6.

Theorem:1.5

5𝑛−1
+3 𝑖𝑓 𝑛 𝑖𝑠 𝑜𝑑𝑑
𝐷 2
The radio D-distance in harmonic mean number of a bistar graph, 𝑟ℎ 𝑛(𝐵(𝑛,𝑛) ) ≤ { 5𝑛 . 𝑛 ≥ 3.
+2 𝑖𝑓 𝑛 𝑖𝑠 𝑒𝑣𝑒𝑛
2

Proof:

Let 𝑉(𝐵(𝑛,𝑛) ) = {𝑥𝑗 / 𝑗 = 1,2. } ∪ {𝑣𝑖 , 𝑢𝑖 / 𝑖 = 1,2, … , 𝑛} , and 𝐸(𝐵(𝑛,𝑛) ) = {𝑥𝑗 𝑥𝑗+1 , 𝑥𝑗 𝑣𝑖 , 𝑥𝑗+1 𝑢𝑖 𝑖 =
1, 2, … , 𝑛 − 1. 𝑎𝑛𝑑 𝑗 = 1} . The 𝑑𝑖𝑎𝑚𝐷𝑑 (𝐵(𝑛,𝑛) ) = 2𝑛 + 3.

Using radio d distance in harmonic mean condition

2𝑓(𝑥1 )𝑓(𝑥2 )
𝐷𝐷 (𝑥1 , 𝑥2 ) + ⌈ ⌉ ≥ 2𝑛 + 4
𝑓(𝑥1 )+𝑓(𝑥2 )

2𝑓(𝑥1 )𝑓(𝑥2 )
2𝑛 + 3 + ⌈ ⌉ ≥ 2𝑛 + 4
𝑓(𝑥1 )+𝑓(𝑥2 )

2𝑓(𝑥1 )𝑓(𝑥2 )
⌈ ⌉ ≥ 1.
𝑓(𝑥1 )+𝑓(𝑥2 )

2𝑓(𝑥1 )𝑓(𝑣𝑖 )
𝐷𝐷 (𝑥1 , 𝑣𝑖 ) + ⌈ ⌉ ≥ 2𝑛 + 4
𝑓(𝑥1 )+𝑓(𝑣𝑖 )

2𝑓(𝑥1 )𝑓(𝑣𝑖 )
(𝑛 + 1) + 2 + ⌈ ⌉ ≥ 2𝑛 + 4
𝑓(𝑥1 )+𝑓(𝑣𝑖 )

2𝑓(𝑥1 )𝑓(𝑣𝑖 )
⌈ ⌉ ≥ 𝑛 + 1. 𝑖 = 1,2, . . , 𝑛.
𝑓(𝑥1 )+𝑓(𝑣𝑖 )

2𝑓(𝑥2 )𝑓(𝑢𝑖)
𝐷𝐷 (𝑥2 , 𝑢𝑖 ) + ⌈𝑓(𝑥 ⌉ ≥ 2𝑛 + 4
2 )+𝑓(𝑢𝑖 )

2𝑓(𝑥2 )𝑓(𝑢𝑖)
(𝑛 + 1) + 2 + ⌈ ⌉ ≥ 2𝑛 + 4
𝑓(𝑥2 )+𝑓(𝑢𝑖)

Impact Factor (JCC): 7.3195 NAAS Rating: 3.76

On Radio D-Distance in Harmonic Mean Labelling of Some Graphs 47

2𝑓(𝑥2 )𝑓(𝑢𝑖 )
⌈ ⌉ ≥ 𝑛 + 1. 𝑖 = 1,2, … , 𝑛.
𝑓(𝑥2 )+𝑓(𝑢𝑖)

5𝑛−1
2
+3 𝑖𝑓 𝑛 𝑖𝑠 𝑜𝑑𝑑
𝐷
Hence 𝑟ℎ 𝑛(𝐵(𝑛,𝑛) ) ≤ { 5𝑛 . 𝑛 ≥ 3.
2
+2 𝑖𝑓 𝑛 𝑖𝑠 𝑒𝑣𝑒𝑛

REFERENCES

1. Amuthavalli.K and Dineshkumar.S, Radio odd mean number of completegraphs. International Journal of Pure and Applied
mathematics, Volume 113,No 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, Vol.9, No.3, pp.969-977, 2017.

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 D-distance number of some graphs communicated

11. ZABOON, GHASSAN KHALAF, and J. YOTI SHRIVAS TAVA. "ENHANCING POWER QUALITY BY COMPENSATING
REACTIVE POWER USING MULTILEVEL STATCOM." International Journal of Electrical and Electronics Engineering
Research (IJEEER) 4. 2, Apr 2014, 265-276

12. Singh, S. A. J. A. N., S. S. Sehgal, and H. S. Gill. "FEM anlaysis of microwave hyperthermia and the effect of SAR
&temperature elevation on liver tumor." International Journal of Mechanical and Production Engineering Research and
Development 3.4 (2017): 183-197.

13. Agrawal, M. E. E. N. A., and A. R. V. I. N. D. Mittal. "Deployment of microgrids in the developed countries: an
appraisal." International Journal of Electrical and Electronics Engineering Research (IJEEER) 4.3 (2014): 23-34.

14. Dhakal, D. R., et al. "Different techniques of structural health monitoring." Research and Development (IJCSEIERD) 3.2
(2013): 55-66.

15. Deshpande, P. S., and J. S. Chitode. "Transformation coding for emotion speech translation: a review." International Journal
of Electrical and Electronics Engineering Research (IJEEER) 6.1 (2016): 1-12.

www.tjprc.org editor@tjprc.org