Abstract
For a graph G, let D(G) be the set of all strong orientations of G. The orientation number of G is d?(G) = min{d(D)|D ? D(G)},where d(D) denotes the diameter of the digraph D. In this paper, we determine the orientation number for some complete tripartite graphs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.