Note on the oriented diameter of graphs with diameter 3

MaRDI QIDQ6227563zbMATH OpenFDO

Authors Hengzhe Li, Xueliang Li, Yuefang Sun, Jun Yue

Publication date 6 September 2011

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Distance in graphs (05C12)

Abstract: In 1978, Chv'atal and Thomassen showed that every bridgeless graph with diameter 2 has an orientation with diameter at most 6. They also gave general bounds on the smallest value $f(d)$ such that every bridgeless graph $G$ with diameter $d$ has an orientation with diameter at most $f(d)$. For $d=3$, they proved that $8leqf(d)leq24$. Until recently, Kwok, Liu and West improved the above bounds by proving $9leqf(3)leq11$ in [P.K. Kwok, Q. Liu and D.B. West, Oriented diameter of graphs with diameter 3, J. Combin. Theory Ser.B 100(2010), 265-274]. In this paper, we determine the oriented diameter among the bridgeless graphs with diameter 3 that have minimum number of edges.

This page was built for publication: Note on the oriented diameter of graphs with diameter 3

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6227563)