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 graph if it is possible to label the vertices x∈V with distinct labels f(x) from 1, 2….., q+1 in such way that when each edge e=uv is labeled with 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 behaviour of subdivision on some standard 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: