Displaying similar documents to “Topological circles and Euler tours in locally finite graphs.”

On edge detour graphs

A.P. Santhakumaran, S. Athisayanathan (2010)

Discussiones Mathematicae Graph Theory

Similarity:

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₁(G) of G is the minimum order of its edge detour sets and any edge detour set of order dn₁(G) is an edge detour basis of G. A connected graph G is called an edge detour graph if it has...