Suppose G is a connected, simple, planar graph with 100 vertices. What is the largest possible number of edges in G?

1 answer

  1. Euler's formula: e ≤ 3v − 6 if v ≥ 3

    Thus, for v=100, e ≤ 294

Answer this Question

Still need help?

You can ask a new question or browse more math questions.