Posted by **Anonymous** on Thursday, March 7, 2013 at 1:58pm.

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

- Maths -
**Gurpreet**, Friday, March 8, 2013 at 6:08am
50*99 = 4950

## Answer this Question

## Related Questions

- math - Suppose G is a connected, simple, planar graph with 100 vertices. What is...
- MATHS - A simple graph G has 200000 edges and for any 3 vertices v,w,x, at least...
- Geometry - A simple graph G has 200000 edges and for any 3 vertices v,w,x, at ...
- Geaometry (Graph) - A graph G has 200000 edges and for any 3 vertices v,w,x, at ...
- Graph Theory/ Algorithms / Computer science - I am working on this problem from ...
- Discrete Mathematics - Let G be a graph with vertex set V = {v1, v2, v3, v4, v5...
- heelp math - A graph is constructed iteratively according to the following ...
- Discrete Mathematics - Consider the complete graph with 5 vertices, denoted by ...
- math - (a). For any connected graph G, all internal nodes of the BFS tree on G ...
- math - How many edges are in K15, the complete graph with 15 vertices