Abstract
2R2 sin A sin B sin C rs ~=~~+ R = + R = + R. s s S l io I by Richard Johnsonbaugh, DePaul University, Chicago, IL. Let A(i, j) dee (i, j)-entry of the n x n matrix A, and interpret A(i, j) as the length of an dg directed from ver ex i to vertex j in an n-vertex digraph. It then follows that k( , j) is the length of a shor est path from i to j containing at most k edges. Thus A (i, j) is the length of a shortest path from i to j co taining a most r + s edges.
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.
