• A NOTE ON GEOMETRIC MEAN GRAPHS

S. Somasundaram, S. S. Sandhya*, S. P. Viji

Abstract


A Graph G = (V,E) with p vertices and q edges is said to be a Geometric mean graph if it is possible to label the vertices xÎV with distinct labels f(x) from 1,2…………q+1 in such a way that when each edge e=uv is labeled with              f(e=uv) = (or) , then the resulting edge labels are distinct. In this case, f is called Geometric mean labeling of G. In this paper, we prove that some new graphs are Geometric mean graphs.


Keywords


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

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/