211 citations · 1.2k across the 74 of their papers we have counts for
1 paper · 2 filters
Pawel Wocjan, Clive Elphick
Let (n+,n0,n−) denote the inertia of a graph G with n vertices. Nordhaus-Gaddum bounds are known for inertia, except for an upper bound for n−. We conjecture that for…