Unformatted text preview: G or the complement G must be nonplanar. (Hint: Consider the number of edges in G and in G .) [3] 4. Show in each case that any graph satisfying the conditions cannot be planar. (a) A graph with 23 vertices and 65 edges. [2] (b) A graph with 23 vertices, 62 edges, and two components. [2] 5. Exhibit a graph G with a vertex v so that ( Gv ) &lt; ( G ) and ( Gv ) &lt; ( G ) where Gv is the graph obtained from G by deleting the vertex v and G is the complement of G . [3]...
View
Full Document
 Spring '11
 HuangJing
 Math, Graph Theory, Vertex, independent set

Click to edit the document details