Abstract
In a directed graph D, given two distinct vertices u and v, the line defined by the ordered pair (u,v) is the set of all vertices w such that u,v and w belong to a shortest directed path in D, containing a shortest directed path from u to v.In this work we study the following conjecture: the number of distinct lines in any strongly connected graph is at least its number of vertices, unless there is a line containing all the vertices.Our main result is that any tournament satisfies this conjecture; we also prove this for bipartite tournaments of diameter at most three.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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 call
