Answers are grounded in this paper and cite their sources.
A Graph G=(V,E) with p vertices and q edges is said to be a Geometric mean if it is possible to label the vertices xv 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) = ⌈√f(u)f(v)⌉ or ⌊√f(u) f(v) ⌋, then the resulting edge labels are distinct. In this case f is called Geometric mean labeling of G. In this paper we investigate the Geometric mean labeling behavior for some new families of Graphs.
No takes yet. Share an insight, caveat, or question.
Somasundaram et al. (2015) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: