Bounds for the minimum oriented diameter
نویسندگان
چکیده
We consider the problem of finding an orientation with minimum diameter of a connected bridgeless graph. Fomin et. al. [7] discovered a relation between the minimum oriented diameter an the size of a minimal dominating set. We improve their upper bound.
منابع مشابه
New bounds on proximity and remoteness in graphs
The average distance of a vertex $v$ of a connected graph $G$is the arithmetic mean of the distances from $v$ to allother vertices of $G$. The proximity $pi(G)$ and the remoteness $rho(G)$of $G$ are defined as the minimum and maximum averagedistance of the vertices of $G$. In this paper we investigate the difference between proximity or remoteness and the classical distanceparameters diameter a...
متن کاملOriented diameter and rainbow connection number of a graph
The oriented diameter of a bridgeless graph G is min{diam(H) |H is an orientation of G}. A path in an edge-colored graph G, where adjacent edges may have the same color, is called rainbow if no two edges of the path are colored the same. The rainbow connection number rc(G) of G is the smallest integer k for which there exists a k-edge-coloring of G such that every two distinct vertices of G are...
متن کاملThe Steiner diameter of a graph
The Steiner distance of a graph, introduced by Chartrand, Oellermann, Tian and Zou in 1989, is a natural generalization of the concept of classical graph distance. For a connected graph $G$ of order at least $2$ and $Ssubseteq V(G)$, the Steiner distance $d(S)$ among the vertices of $S$ is the minimum size among all connected subgraphs whose vertex sets contain $S$. Let $...
متن کاملBounds for the minimum diameter of integral point sets
Geometrical objects with integral sides have attracted mathematicians for ages. For example, the problem to prove or to disprove the existence of a perfect box, that is, a rectangular parallelepiped with all edges, face diagonals and space diagonals of integer lengths, remains open. More generally an integral point set P is a set of n points in the m-dimensional Euclidean space Em with pairwise...
متن کاملLower bounds for the minimum diameter of integral point sets
We improve a known lower bound for the minimum diameter of integral point sets.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics & Theoretical Computer Science
دوره 14 شماره
صفحات -
تاریخ انتشار 2012