This preview shows page 1. Sign up to view the full content.
Unformatted text preview: G or the complement G must be nonplanar. (Hint: Consider the number of edges in G and in G .)  4. Show in each case that any graph satisfying the conditions cannot be planar. (a) A graph with 23 vertices and 65 edges.  (b) A graph with 23 vertices, 62 edges, and two components.  5. Exhibit a graph G with a vertex v so that ( G-v ) &lt; ( G ) and ( G-v ) &lt; ( G ) where G-v is the graph obtained from G by deleting the vertex v and G is the complement of G . ...
View Full Document
This note was uploaded on 01/15/2012 for the course MATH 222 taught by Professor Huangjing during the Spring '11 term at University of Victoria.
- Spring '11