P
Initializing...
Theorem 21, p. 20 — for large n, a connected graph maximizing λ₁ − d is a pineapple (Aouchiche et al.) · Prove2Me