• SOME NEW RESULTS ON HARMONIC MEAN GRAPHS

S. S. Sandhya*, C. David Raj, C. Jayasekaran

Abstract


A Graph G = (V, E) with p vertices and q edges is called a Harmonic mean graph if it is possible to label the vertices xÎV with distinct labels from 1,2….q+1 in such a way that when each edge e = uv is labeled with

f(e = uv) = (or) , then the edge labels are distinct. In this case f is called Harmonic Mean labeling of G.

In this paper we prove the Harmonic mean labeling behaviour for some new graphs.


Keywords


Graph, Harmonic mean graph, Path, Cycle, Star graph, Union of graphs, Comb, Crown.

Full Text:

PDF


Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2022 International Journal of Mathematical Archive (IJMA)
Copyright Agreement & Authorship Responsibility
Web Counter
https://section.iaesonline.com/akun-pro-kamboja/https://journals.uol.edu.pk/sugar-rush/http://mysimpeg.gowakab.go.id/mysimpeg/aset/https://jurnal.jsa.ikippgriptk.ac.id/plugins/https://ppid.cimahikota.go.id/assets/demo/https://journals.zetech.ac.ke/scatter-hitam/https://silasa.sarolangunkab.go.id/swal/https://sipirus.sukabumikab.go.id/storage/uploads/-/sthai/https://sipirus.sukabumikab.go.id/storage/uploads/-/stoto/https://alwasilahlilhasanah.ac.id/starlight-princess-1000/https://www.remap.ugto.mx/pages/slot-luar-negeri-winrate-tertinggi/https://waper.serdangbedagaikab.go.id/storage/sgacor/https://waper.serdangbedagaikab.go.id/public/images/qrcode/slot-dana/https://siipbang.katingankab.go.id/storage_old/maxwin/https://waper.serdangbedagaikab.go.id/public/img/cover/10k/