Abstract
Diameter of an undirected graph is the maximal distance between any two vertices. We can obtain a digraph (directed graph) by presenting a direction for each edge of the undirected graph. The diameter of a digraph is a nonegative integer d, such that the distance of any two vertices which are strongly connected is at most d. Or else, the diameter is infinite. In this paper we discuss minimal diameter orientation of special graph-complete split graph. Combining the theory of multipartite graph and the property of complete split graph we can obtain what kind of split graph can be 2-diameter oriented.
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.