Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

I'm looking at a specific type of graph, and my google-fu has failed me. The graph $G$ is a connected unweighted directed graph where for each pair of vertices $(u,v) \in G$ the shortest path from $u$ to $v$ is unique.

What is such a graph called?

share|improve this question
    
Geodetic? cstheory.stackexchange.com/questions/16354/… answers this question anyhow! –  Sharkos May 8 '13 at 15:38

1 Answer 1

up vote 2 down vote accepted

Yes, such graphs are apparently referred to as geodetic graphs, as in http://www.graphclasses.org/classes/gc_96.html My first guess was geodesic, so I wasn't far off.

Elsewhere on the internet, USP seems to be used as an obvious acronym.

share|improve this answer
    
Perfect, thanks! –  Foo Barrigno May 8 '13 at 16:17

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.