On optimal orientations of complete tripartite graphs

From MaRDI portal
Publication:5000286




Abstract: Given a connected and bridgeless graph G, let mathscrD(G) be the family of strong orientations of G. The orientation number of G is defined to be , where d(D) is the diameter of the digraph D. In this paper, we focus on the orientation number of complete tripartite graphs. We prove a conjecture raised by Rajasekaran and Sampathkumar. Specifically, for qgepge3, if , then qlepchooselfloorp/2floor. We also present some sufficient conditions on p and q for .





Describes a project that uses

Uses Software





This page was built for publication: On optimal orientations of complete tripartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5000286)