Given a connected and bridgeless graph G, let D (G) be the set of all strong orientations of G, and define the oriented diameter of G to be? (G) = mindiam (D) | D? D (G). Rajasekaran and Sampathkumar (Filomat, 2015) conjectured f (K (2, p, q) ) = 3 when p? 5 and q > (p? p/2? ). In this paper, we confirm this conjecture. Combining with the results of Koh and Tan (Graphs and Combinatorics, 1996), the oriented diameter of complete tripartite graph K (2, p, q) is completely determined.
Liu et al. (Wed,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: