On geometric mean graphs of order \(\leq 5\) (Q2926087)

Consider a graph \(G\) with \(|E(G)|=q\). Assume that there is an injective labelling \(f:V(G)\rightarrow \{1,2,\dots, q+1\}\). We say that \(f\) is a geometric mean labelling of \(G\) if there is an induced injective labelling of edges where each edge \((u,v)\) is labelled with either \(\left\lceil\sqrt{f(u)f(v)}\right\rceil\) or \(\left\lfloor\sqrt{f(u)f(v)}\right\rfloor\). \(G\) is a geometric mean graph if it allows a geometric mean labelling. The authors determine all the geometric mean graphs of order at most 5.