Post a New Question
posted by Anonymous on Friday, March 8, 2013 at 12:36am.
Suppose G is a connected, simple, planar graph with 100 vertices. What is the largest possible number of edges in G?
Euler's formula: e ≤ 3v − 6 if v ≥ 3 Thus, for v=100, e ≤ 294
More Related Questions