# Oriented diameter of graphs with given maximum degree

Oriented diameter of graphs with given maximum degree In this article, we show that every bridgeless graph G of order n and maximum degree Δ has an orientation of diameter at most n−Δ+3. We then use this result and the definition NG(H)=⋃v∈V(H)NG(v)∖V(H), for every subgraph H of G, to give better bounds in the case that G contains certain clusters of high‐degree vertices, namely: For every edge e, G has an orientation of diameter at most n−|NG(e)|+4, if e is on a triangle and at most n−|NG(e)|+5, otherwise. Furthermore, for every bridgeless subgraph H of G, there is such an orientation of diameter at most n−|NG(H)|+3. Finally, if G is bipartite, then we show the existence of an orientation of diameter at most 2(|A|− deg G(s))+7, for every partite set A of G and s∈V(G)∖A. This particularly implies that balanced bipartite graphs have an orientation of diameter at most n−2Δ+7. For each bound, we give a polynomial‐time algorithm to construct a corresponding orientation and an infinite family of graphs for which the bound is sharp. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of Graph Theory Wiley

# Oriented diameter of graphs with given maximum degree

, Volume 88 (1) – Jan 1, 2018
13 pages

/lp/wiley/oriented-diameter-of-graphs-with-given-maximum-degree-SpbMdhD9F1
Publisher
Wiley Subscription Services, Inc., A Wiley Company
ISSN
0364-9024
eISSN
1097-0118
D.O.I.
10.1002/jgt.22181
Publisher site
See Article on Publisher Site

### Abstract

In this article, we show that every bridgeless graph G of order n and maximum degree Δ has an orientation of diameter at most n−Δ+3. We then use this result and the definition NG(H)=⋃v∈V(H)NG(v)∖V(H), for every subgraph H of G, to give better bounds in the case that G contains certain clusters of high‐degree vertices, namely: For every edge e, G has an orientation of diameter at most n−|NG(e)|+4, if e is on a triangle and at most n−|NG(e)|+5, otherwise. Furthermore, for every bridgeless subgraph H of G, there is such an orientation of diameter at most n−|NG(H)|+3. Finally, if G is bipartite, then we show the existence of an orientation of diameter at most 2(|A|− deg G(s))+7, for every partite set A of G and s∈V(G)∖A. This particularly implies that balanced bipartite graphs have an orientation of diameter at most n−2Δ+7. For each bound, we give a polynomial‐time algorithm to construct a corresponding orientation and an infinite family of graphs for which the bound is sharp.

### Journal

Journal of Graph TheoryWiley

Published: Jan 1, 2018

Keywords: ; ; ; ; ;

## You’re reading a free preview. Subscribe to read the entire article.

### DeepDyve is your personal research library

It’s your single place to instantly
that matters to you.

over 18 million articles from more than
15,000 peer-reviewed journals.

All for just \$49/month

### Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

### Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

### Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

### Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

DeepDyve

DeepDyve

### Pro

Price

FREE

\$49/month
\$360/year

Save searches from
PubMed

Create lists to

Export lists, citations