Logarithmic and identric mean labelings of graphs
Abstract
Graph labeling was first introduced by Rosa in 1966. Labeling of graphs is an assignment of nonnegative integers to vertices, edges or both according to some specified conditions. Mean labeling of graphs was introduced by Somasundaram and Ponraj in 2003. Subsequently, labelings of graphs were done with geometric mean, harmonic mean etc. In this paper we introduce two concepts called ’Logarithmic mean labeling’, ’Identric mean labeling’ and acquire their mean labelings for some standard graphs.
- Published
- 7 September 2020
- Volume
- 2020 (2020)
- License
- CC BY 3.0
Copyright © 2020 S. Alagu, R. Kala. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Cite this article
S. Alagu, R. Kala, Logarithmic and identric mean labelings of graphs, Adv. Inequal. Appl. 2020 (2020), 8. https://doi.org/10.28919/aia/4865
BibTeX
@article{Alagu2020,
author = {Alagu, S. and Kala, R.},
title = {Logarithmic and identric mean labelings of graphs},
journal = {Adv. Inequal. Appl.},
volume = {2020},
year = {2020},
pages = {8},
doi = {10.28919/aia/4865}
}