Abstract
For a graph G, letG?(G?) denote an orientation ofG having maximum (minimum respectively) finite diameter. We show that the length of the longest path in any 2-edge connected (undirected) graph G is precisely diam(G?). LetK(m l ,m 2,...,m n) be the completen-partite graph with parts of cardinalitiesm 1 m2, ?,m n . We prove that ifm 1 = m2 = ? =m n = m,n ? 3, then diam(K?(m1,m2,...,mn)) = 2, unless m=1 andn = 4.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
