This preview shows pages 1–4. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: 1 10 r n 2 . Prove: if n 2 N , r n = 2 n +5 n . 6. Consider the graph G pictured to the right. (a) [3 pt] Find the chromatic number of G , ( G ). (b) [5 pt] Identify (i) an independent set that is not maximal, (ii) a maximal independent set; and (iii) compute the independence number of G , ( G ). Clearly label each. (c) [2 pt] Yes or No: Are there any maximal independent sets in G that are not maximum? 7. TRUE or FALSE . Spell out the word you choose. (a) A connected graph must have a spanning tree. (b) Every tree with two or more vertices must have at least two leaves. (c) If f : A ! B is onetoone, and dom( f 1 ) = B , then f is a bijection. (d) If the average degree of a connected graph is two, then the graph must be a tree. (e) There are 2 n 2 induced subgraphs of K n ....
View
Full
Document
This note was uploaded on 03/19/2010 for the course EOE 342 taught by Professor Jooe during the Spring '10 term at Albany College of Pharmacy and Health Sciences.
 Spring '10
 Jooe

Click to edit the document details