This paper studies the problem of orienting all edges of a weighted graph such that the
maximum weighted outdegree of vertices is minimized. This problem, which has …

Given a simple, undirected graph G=(V, E) and a weight function w: E→ ℤ+, we consider the
problem of orienting all edges in E so that the maximum weighted outdegree among all …

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 …

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 …

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 …

In this paper, we show that the oriented diameter of any n-vertex 2-connected near
triangulation is at most⌈ n 2⌉(except for seven small exceptions), and the upper bound is …

Graph theory is a very popular area of discrete mathematics with not only numerous
theoretical developments, but also countless applications to practical problems. As a …