A degree condition for diameter two orientability of graphs
classification
🧮 math.CO
keywords
deltadegreediameteradmitsconditioneveryfracgraph
read the original abstract
For $n \in \mathbb{N}$ let $\delta_n$ be the smallest value such that every graph of order $n$ and minimum degree at least $\delta_n$ admits an orientation of diameter two. We show that $\delta_n=\frac{n}{2} + \Theta(\ln n)$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.