A degree condition for diameter two orientability of graphs
Abstract
For n ∈ N let δn be the smallest value such that every graph of order n and minimum degree at least δn admits an orientation of diameter two. We show that δn=n2 + ( n).
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.