Range of diameters of a bipartite graph and its generalized 2-partite complement (Q1886885)

Following \textit{E. Sampathkumar} and \textit{L. Pushpalatha} [Graphs Comb. 14, No. 4, 377--392 (1998; Zbl 0914.05056)], the authors define the generalized complement of a graph \(G\) with respect to a 2-partition \(Q=\{W_1,W_2\}\) of \(V(G)\) as a graph \(G_Q\) obtained from \(G\) by removing the edges between \(W_1\) and \(W_2\) and adding the edges between \(W_1\) and \(W_2\) which are not in \(G\). The authors enumerate all triples \((a,b,p)\) for which there exists a bipartite graph \(G\) and a 2-partition \(Q\) of \(V(G)\) (not necessarily the same as the bipartition of \(G\)) such that the diameter \(d(G)=a\), \(d(G_Q)=b\) and \(| V(G)| =p\).