#### Filter Results:

#### Publication Year

2010

2011

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

For two vertices u and v in a graph G = (V, E), the detour distance D(u, v) is the length of a longest u–v path in G. A u–v path of length D(u, v) is called a u–v detour. A set S ⊆ V is called an edge detour set if every edge in G lies on a detour joining a pair of vertices of S. The edge detour number dn 1 (G) of G is the minimum order of its edge detour… (More)

- ‹
- 1
- ›