Solutions for HW11. Exercise 34. (a) Use the recurrence relation t(g) = t(g e) + t(g/e) to count the number of spanning trees of v 1

Similar documents
12/3/12. Outline. Part 10. Graphs. Circuits. Euler paths/circuits. Euler s bridge problem (Bridges of Konigsberg Problem)

5/9/13. Part 10. Graphs. Outline. Circuits. Introduction Terminology Implementing Graphs

Math 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes.

b. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s?

Paths. Connectivity. Euler and Hamilton Paths. Planar graphs.

Outline. Circuits. Euler paths/circuits 4/25/12. Part 10. Graphs. Euler s bridge problem (Bridges of Konigsberg Problem)

0.1. Exercise 1: the distances between four points in a graph

The University of Sydney MATH2969/2069. Graph Theory Tutorial 5 (Week 12) Solutions 2008

Graph Isomorphism. Graphs - II. Cayley s Formula. Planar Graphs. Outline. Is K 5 planar? The number of labeled trees on n nodes is n n-2

COMP108 Algorithmic Foundations

An undirected graph G = (V, E) V a set of vertices E a set of unordered edges (v,w) where v, w in V

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

Algorithmic and NP-Completeness Aspects of a Total Lict Domination Number of a Graph

Garnir Polynomial and their Properties

Graphs. CSC 1300 Discrete Structures Villanova University. Villanova CSC Dr Papalaskari

CSC Design and Analysis of Algorithms. Example: Change-Making Problem

Exam 1 Solution. CS 542 Advanced Data Structures and Algorithms 2/14/2013

, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management

1. Determine whether or not the following binary relations are equivalence relations. Be sure to justify your answers.

CSE 373. Graphs 1: Concepts, Depth/Breadth-First Search reading: Weiss Ch. 9. slides created by Marty Stepp

MAT3707. Tutorial letter 201/1/2017 DISCRETE MATHEMATICS: COMBINATORICS. Semester 1. Department of Mathematical Sciences MAT3707/201/1/2017

Why the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1.

Planar Upward Drawings

CSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018

5/7/13. Part 10. Graphs. Theorem Theorem Graphs Describing Precedence. Outline. Theorem 10-1: The Handshaking Theorem

Graphs. Graphs. Graphs: Basic Terminology. Directed Graphs. Dr Papalaskari 1

Solutions to Homework 5

CSE 373: AVL trees. Warmup: Warmup. Interlude: Exploring the balance invariant. AVL Trees: Invariants. AVL tree invariants review

CSI35 Chapter 11 Review

QUESTIONS BEGIN HERE!

CS200: Graphs. Graphs. Directed Graphs. Graphs/Networks Around Us. What can this represent? Sometimes we want to represent directionality:

Module graph.py. 1 Introduction. 2 Graph basics. 3 Module graph.py. 3.1 Objects. CS 231 Naomi Nishimura

1 Introduction to Modulo 7 Arithmetic

The University of Sydney MATH 2009

(2) If we multiplied a row of B by λ, then the value is also multiplied by λ(here lambda could be 0). namely

Solutions for HW9. Bipartite: put the red vertices in V 1 and the black in V 2. Not bipartite!

CS 461, Lecture 17. Today s Outline. Example Run

Present state Next state Q + M N

COMPLEXITY OF COUNTING PLANAR TILINGS BY TWO BARS

Constructive Geometric Constraint Solving

Cycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology!

CS 241 Analysis of Algorithms

# 1 ' 10 ' 100. Decimal point = 4 hundred. = 6 tens (or sixty) = 5 ones (or five) = 2 tenths. = 7 hundredths.

Announcements. Not graphs. These are Graphs. Applications of Graphs. Graph Definitions. Graphs & Graph Algorithms. A6 released today: Risk

CS61B Lecture #33. Administrivia: Autograder will run this evening. Today s Readings: Graph Structures: DSIJ, Chapter 12

CS September 2018

QUESTIONS BEGIN HERE!

ECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS

NP-Completeness. CS3230 (Algorithm) Traveling Salesperson Problem. What s the Big Deal? Given a Problem. What s the Big Deal? What s the Big Deal?

Grade 7/8 Math Circles March 4/5, Graph Theory I- Solutions

Problem solving by search

Complete Solutions for MATH 3012 Quiz 2, October 25, 2011, WTT

Section 10.4 Connectivity (up to paths and isomorphism, not including)

18.06 Problem Set 4 Due Wednesday, Oct. 11, 2006 at 4:00 p.m. in 2-106

Numbering Boundary Nodes

Binomials and Pascal s Triangle

Outline. 1 Introduction. 2 Min-Cost Spanning Trees. 4 Example

DUET WITH DIAMONDS COLOR SHIFTING BRACELET By Leslie Rogalski

EE1000 Project 4 Digital Volt Meter

The Plan. Honey, I Shrunk the Data. Why Compress. Data Compression Concepts. Braille Example. Braille. x y xˆ

d e c b a d c b a d e c b a a c a d c c e b

Section 3: Antiderivatives of Formulas

Outline. Computer Science 331. Computation of Min-Cost Spanning Trees. Costs of Spanning Trees in Weighted Graphs

More Foundations. Undirected Graphs. Degree. A Theorem. Graphs, Products, & Relations

Chapter 9. Graphs. 9.1 Graphs

Instructions for Section 1

Math 166 Week in Review 2 Sections 1.1b, 1.2, 1.3, & 1.4

Weighted graphs -- reminder. Data Structures LECTURE 15. Shortest paths algorithms. Example: weighted graph. Two basic properties of shortest paths

INTEGRALS. Chapter 7. d dx. 7.1 Overview Let d dx F (x) = f (x). Then, we write f ( x)

12. Traffic engineering

S i m p l i f y i n g A l g e b r a SIMPLIFYING ALGEBRA.

learning objectives learn what graphs are in mathematical terms learn how to represent graphs in computers learn about typical graph algorithms

Similarity Search. The Binary Branch Distance. Nikolaus Augsten.

Mid-Term Examination - Spring 2014 Mathematical Programming with Applications to Economics Total Score: 45; Time: 3 hours

Seven-Segment Display Driver

Discovering Pairwise Compatibility Graphs

Analysis for Balloon Modeling Structure based on Graph Theory

10/30/12. Today. CS/ENGRD 2110 Object- Oriented Programming and Data Structures Fall 2012 Doug James. DFS algorithm. Reachability Algorithms

Greedy Algorithms, Activity Selection, Minimum Spanning Trees Scribes: Logan Short (2015), Virginia Date: May 18, 2016

Counting Paths Between Vertices. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs

Practice Test I Bonding and Geometry Name Per

Announcements. These are Graphs. This is not a Graph. Graph Definitions. Applications of Graphs. Graphs & Graph Algorithms

Last time: introduced our first computational model the DFA.

TOPIC 5: INTEGRATION

Jonathan Turner Exam 2-10/28/03

Integration Continued. Integration by Parts Solving Definite Integrals: Area Under a Curve Improper Integrals

Graph Contraction and Connectivity

Math Lesson 4-5 The Law of Cosines

Designing A Concrete Arch Bridge

In which direction do compass needles always align? Why?

16.unified Introduction to Computers and Programming. SOLUTIONS to Examination 4/30/04 9:05am - 10:00am

What do you know? Listen and find. Listen and circle. Listen and chant. Listen and say. Lesson 1. sheep. horse

UNCORRECTED SAMPLE PAGES 4-1. Naming fractions KEY IDEAS. 1 Each shape represents ONE whole. a i ii. b i ii

Trees as operads. Lecture A formalism of trees

Polygons POLYGONS.

1 PYTHAGORAS THEOREM 1. Given a right angled triangle, the square of the hypotenuse is equal to the sum of the squares of the other two sides.

Exercise sheet 6: Solutions

Quartets and unrooted level-k networks

COMP 250. Lecture 29. graph traversal. Nov. 15/16, 2017

Transcription:

Solutions for HW Exris. () Us th rurrn rltion t(g) = t(g ) + t(g/) to ount th numr of spnning trs of v v v u u u Rmmr to kp multipl gs!! First rrw G so tht non of th gs ross: v u v Rursing on = (v, u ): u v u t(g) = t(g ) + t(g/) = 6 +. () Wht is th Prüfr o for th following ll tr? Chk your nswr y rvrsing th pross n uiling th tr from th o. Answr:,7,,,. 7 () Drw th tr whos Prüfr o is,,,, 6. Chk your nswr y lulting th Prüfr o tht gos with your tr. 6 7 6 () Drw ll K (ll with,, ), n list ll th spnning trs, n th orrsponing Prüfr o. Vrify tht thr is ijtion twn th ll trs on vrtis n th lngth- Prüfr os. () How mny spnning trs os K 7 hv? (f) How mny ll trs r thr on vrtis?

Exris. () For th following prmuttions w, rw T (w) n T (w). Vrify tht T (w) n T (w) r inrsing. (i) w = 687 T (687) = 6 8 7 T (687) = 6 8 7 (ii) w = T () = T () = 0 (iii) w = 0 T () = T () =

() Lt T = 6 8. 7 If T = T (w), wht is w? Vrify tht th oul riss, oul snts, vllys, n pks of w orrspon to th orrt hvior of sussors. () Lt If T = T (w), thn w = 876. 0 T = 6. 8 7 If T = T (w), wht is w? Vrify th following for T (w). If T = T (w), thn w = 876. (i) Th sussors of 0 r just th lft-to-right minim of w. (ii) Th lvs r w(i) i D(w) n}}. w(i) i D(w)} =, 8, 7, 6} () Brifly justify h of () () in Proposition.. of EC. () Brifly justify h of () () in Proposition.. of EC. Exris 6. Lt A, B, C, n D th grphs A = B = g f f

C = f () Clult th hromti numrs for A, B, C, n D. For h, giv n xmpl of vrtx oloring of th orrsponing grph using xtly χ olors. Colorings init y olors,,,... : D = A = B = C = D = Sin A, B, n B ll hv liqus of siz, thir hromti numrs r t lst, n D hs gs, so its hromti numr is t lst. Thus, y th olorings provi ov, w hv χ(a) = χ(b) = χ(c) =, χ(d) =. () Wht r th liqu n inpnn numrs of A, B, C, n D? How o ω n V /α ompr to χ for h grph? Th liqu numrs r givn y ω(a) = ω(b) = ω(c) =, ω(d) =, whih xtly mth th hromti numr. Th inpnn numrs r givn y α(a) =,, } =, α(b) = f,, } =, α(c) =, f} =, α(d) =,, } =, so tht V (A) /α(a) = 6/ =, V (B) /α(b) = 7/ =., V (C) /α(c) = 6/ =, V (D) /α(d) = / =. 6, whos ilings giv shrp ouns for th hromti numrs of B, C, n C, ut not A.

() Wht r th hromti numrs of (i) K m,n, (ii) C n, (iii) W n, n (iv) Q n? n vn, (i) χ(k m,n ) =, (ii) χ(c n ) = n o, n vn, (iii) χ(w n ) = n o,, n (iv) χ(q n) =. () Wht r th liqu n inpnn numrs of (i) K m,n, (ii) C n, (iii) W n, (iv) Q n? How o ω n V /α ompr to χ for h grph? (You my n to rk into ss.) ω(k m,n ) = n =, ω(c n ) = n > n = ω(w n ) = n > ω(q n ) =. α(k m,n ) = mx(m, n) α(c n ) = n/ α(w n ) = n/ α(q n ) = n. () Wht r nssry n suffiint onitions for grph to hv hromti numr (i), n (ii). Th hromti numr of G is if n only if G hs no gs. Th hromti numr of G is if n only if G is iprtit n ontins n g. (f) For A, B, C, n D, pik n orring of th vrtis n olor th grph using th gry lgorithm. Compr th olors you us to th hromti numr of th grph. Cn you fin n orring tht yils oloring with too mny olors? (g) Explin why th liqu numr of th omplmnt of iprtit is no smllr thn th numr of vrtis in h prt. (Rll tht th prts of iprtit grph r th two olltions of pirwis non-jnt vrtis.) Sin h prt of iprtit grph is n inpnnt st, tht st forms liqu in th omplmnt.

(h) Noti tht th grph x x x x 7 G = x x x 6 x 8 is iprtit, so shoul hv hromti numr. Now olor this grph using th gry lgorithm. How mny olors i you n? Answr: Exris 7. () Comput th numr of wys to olor th grph with h of,,..., V olors for G = n H = χ(, 0) χ(, ) χ(, ) χ(, ) χ(, ) G 0 0 0 H 0 0 0 () Clult th hromti polynomil for G ov. Answr: χ(g, t) = t(t ) (t ), χ(g, t) = t(t )(t ). () Th hromti polynomil for th yl C n is χ(c n, k) = (k ) n + ( ) n (k ). (i) Drw ll th wys of oloring th -yl with olors. Thn omput χ(c, ) n ompr your nswrs. Orr th vrtis in lokwis orr. Choos th olor for th first vrtx ( hois), thn th son ( hois), n finlly th thir vrtx ( hoi), giving 6 olorings. This mths χ(c, ) = ( ) + ( ) ( ) = = 6. (ii) How mny wys r thr to olor th -yl with olors? χ(c, ) = ( ) + ( ) ( ) =. (iii) How mny wys r thr to olor th 6-yl with olors? χ(c, ) = ( ) 6 + ( ) 6 ( ) = + =.

(iv) Us χ(c n, k) to vrify tht vn yls r iprtit n o yls r not. For n vn or o, χ(c n, ) = ( ) n + ( ) n ( ) = 0. For n vn, χ(c n, ) = ( ) n + ( ) n ( ) = + = 0, so χ(c n ) =. For n o, χ(c n, ) = ( ) n + ( ) n ( ) = = 0, so χ(c n ) >.