An orientation of an undirected graph G is an assignment of exactly one direction to each
edge of G. The oriented diameter of a graph G is the smallest diameter among all the …

In this article, we show that every bridgeless graph G of order n and maximum degree Δ has
an orientation of diameter at most. We then use this result and the definition, for every …

In 1978, Chvátal and Thomassen proved that every 2-edge-connected graph with diameter
2 has an orientation with diameter at most 6. They also gave general bounds on the smallest …

Abstract In 2015, Bau and Dankelmann showed that every bridgeless graph G of order n
and minimum degree δ has an orientation of diameter at most 11 n δ+ 1+ 9. As they were …

Diameter of orientations of graphs with given minimum degree - ScienceDirect Skip to main
contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View PDF …

An extremity is a vertex such that the removal of its closed neighbourhood does not increase
the number of connected components. Let $ Ext_ {\alpha} $ be the class of all connected …

A connected road network with N nodes and L edges has K ≤ L edges identified as one-
way roads. In a feasible direction, these one-way roads are assigned a direction each, so …

Bounds for the minimum oriented diameter Page 1 Discrete Mathematics and Theoretical
Computer Science DMTCS vol. 14:1, 2012, 109–142 Bounds for the minimum oriented diameter …

The diameter of an undirected or a directed graph is defined to be the maximum shortest
path distance over all pairs of vertices in the graph. Given an undirected graph G, we …

In this paper, we show that the oriented diameter of any $ n $-vertex $2 $-connected near
triangulation is at most $\lceil {\frac {n}{2}}\rceil $(except for seven small exceptions), and the …