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

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

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

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

The University of Sydney MATH 2009

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

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

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

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

Tangram Fractions Overview: Students will analyze standard and nonstandard

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

Spanning Trees. BFS, DFS spanning tree Minimum spanning tree. March 28, 2018 Cinda Heeren / Geoffrey Tien 1

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

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

Weighted Graphs. Weighted graphs may be either directed or undirected.

(Minimum) Spanning Trees

In which direction do compass needles always align? Why?

Divided. diamonds. Mimic the look of facets in a bracelet that s deceptively deep RIGHT-ANGLE WEAVE. designed by Peggy Brinkman Matteliano

QUESTIONS BEGIN HERE!

5/1/2018. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees

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

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

Present state Next state Q + M N

MCS100. One can begin to reason only when a clear picture has been formed in the imagination.

CS 103 BFS Alorithm. Mark Redekopp

Strongly connected components. Finding strongly-connected components

ECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS

Lecture 20: Minimum Spanning Trees (CLRS 23)

QUESTIONS BEGIN HERE!

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

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

Planar Upward Drawings

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

Improving Union. Implementation. Union-by-size Code. Union-by-Size Find Analysis. Path Compression! Improving Find find(e)

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

Theorem 1. An undirected graph is a tree if and only if there is a unique simple path between any two of its vertices.

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

BASIC CAGE DETAILS SHOWN 3D MODEL: PSM ASY INNER WALL TABS ARE COINED OVER BASE AND COVER FOR RIGIDITY SPRING FINGERS CLOSED TOP

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

CMPS 2200 Fall Graphs. Carola Wenk. Slides courtesy of Charles Leiserson with changes and additions by Carola Wenk

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

Decimals DECIMALS.

1 Introduction to Modulo 7 Arithmetic

OpenMx Matrices and Operators

4.1 Interval Scheduling. Chapter 4. Greedy Algorithms. Interval Scheduling: Greedy Algorithms. Interval Scheduling. Interval scheduling.

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

Physics 222 Midterm, Form: A

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

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

1 I ( can / can t ) read a book, but I ( can / can t ) read a map. 2 They ( can / can t ) swim, but they ( can / can t ) pitch a tent.

BASIC CAGE DETAILS D C SHOWN CLOSED TOP SPRING FINGERS INNER WALL TABS ARE COINED OVER BASE AND COVER FOR RIGIDITY

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

Depth First Search. Yufei Tao. Department of Computer Science and Engineering Chinese University of Hong Kong

RUTH. land_of_israel: the *country *which God gave to his people in the *Old_Testament. [*map # 2]

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

24CKT POLARIZATION OPTIONS SHOWN BELOW ARE REPRESENTATIVE FOR 16 AND 20CKT

EE1000 Project 4 Digital Volt Meter

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

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

Nefertiti. Echoes of. Regal components evoke visions of the past MULTIPLE STITCHES. designed by Helena Tang-Lim

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

Planar convex hulls (I)

G-001 SACO SACO BAY BIDDEFORD INDEX OF NAVIGATION AIDS GENERAL NOTES: GENERAL PLAN A6 SCALE: 1" = 1000' CANADA MAINE STATE PLANE GEOGRAPHIC NO.

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

STRUCTURAL GENERAL NOTES

COMPLEXITY OF COUNTING PLANAR TILINGS BY TWO BARS

Designing A Uniformly Loaded Arch Or Cable

CMSC 451: Lecture 4 Bridges and 2-Edge Connectivity Thursday, Sep 7, 2017

Edge-Triggered D Flip-flop. Formal Analysis. Fundamental-Mode Sequential Circuits. D latch: How do flip-flops work?

CS 241 Analysis of Algorithms

24.1 Sex-Linked Inheritance. Chapter 24 Chromosomal Basis of Inheritance Sex-Linked Inheritance Sex-Linked Inheritance

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

Seven-Segment Display Driver

Designing A Concrete Arch Bridge

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

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

DUET WITH DIAMONDS COLOR SHIFTING BRACELET By Leslie Rogalski

AIR FORCE STANDARD DESIGN MILITARY WORKING DOG FACILITY

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

Graph Search (6A) Young Won Lim 5/18/18

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

N=4 L=4. Our first non-linear data structure! A graph G consists of two sets G = {V, E} A set of V vertices, or nodes f

(4, 2)-choosability of planar graphs with forbidden structures

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

G-001 CHATHAM HARBOR AUNT LYDIA'S COVE CHATHAM ATLANTIC OCEAN INDEX OF NAVIGATION AIDS GENERAL NOTES: GENERAL PLAN A6 SCALE: 1" = 500' CANADA

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

SOCKET WELD OR THREADED BODY TYPE (3051SFP FLOWMETER SHOWN THROUGHOUT / 3051CFP, 2051CFP AVAILABLE)

Constructive Geometric Constraint Solving

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

ROSEMOUNT 3051SAM SCALABLE PRESSURE TRANSMITTER COPLANAR FLANGE PROCESS CONNECTION

Problem 1. Solution: = show that for a constant number of particles: c and V. a) Using the definitions of P

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

Indices. Indices. Curriculum Ready ACMNA: 209, 210, 212,

176 5 t h Fl oo r. 337 P o ly me r Ma te ri al s

Platform Controls. 1-1 Joystick Controllers. Boom Up/Down Controller Adjustments

DFA Minimization. DFA minimization: the idea. Not in Sipser. Background: Questions: Assignments: Previously: Today: Then:

EXAMPLE 87.5" APPROVAL SHEET APPROVED BY /150HP DUAL VFD CONTROL ASSEMBLY CUSTOMER NAME: CAL POLY SLO FINISH: F 20

CSE 332. Data Structures and Parallelism

CSE 332. Graphs 1: What is a Graph? DFS and BFS. Data Abstractions. CSE 332: Data Abstractions. A Graph is a Thingy... 2

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

Transcription:

ulty o Mtmtis Wtrloo, Ontrio N ntr or ution in Mtmtis n omputin r / Mt irls Mr /, 0 rp Tory - Solutions * inits lln qustion. Tr t ollowin wlks on t rp low. or on, stt wtr it is pt? ow o you know? () n () r pts sin ty o not rpt vrtis. Noti tt is rpt in () n (), n is rpt in (). () ----- () ------ () --- () ------ () ------

. in 0 wlks rom to in t ollowin rp. ow mny o ts wlks r pts? ow mny possil pts r tr twn n. (int: You my wnt to rrw t rp) 0 Tr r mny wlks possil. Stunts soul striv to in t lst 0. Rmmr tt wlks n inlu rpt vrtis. Tr r pts rom to : -, --, -----0-, --0-, ----0-, ----0--, -----, -----0-.. in ll t yls in t ollowin rp. Tr r yls: ----, ----, ---, -----, ------, -------.. Wi s soul to t rp low to mk it? Writ t nms o t s n tn rw tm on t rp. T s {,}, {,}, n {,} soul so t rp looks lik t on low.

j Ptrsn rp. k-rulr rp is rp wit k s inint to vrtx. n xmpl o tis is t Ptrsn rp wi is typ o -rulr rp. i u, Ryn, Vin, mily, n Nin o to prty. Wn ty t tr ty wnt to sk ns ut ty only v tim to sk two otr popl s ns. rw two irnt rps to sow ow tis n ppn. ow mny nsks r tr? o t ruls or rwin rp mk sns in tis sitution? rps will vry. vrtx soul inint to s. Tr soul s totl. Tr r nsks. Ys, t ruls mk sns sin you n not sk ns wit yoursl n it os not mk sns to v two irnt nsks twn t sm popl sin ty v lry skn ns on.. Sr s lttr tt s wnts to iv to mily. ut ty won t s otr us ty r in irnt itis. nswr t ollowin qustions. T quikst wy is t ollowin pt: Sr-Vin-Ryn-u-Nin-mily mily Sr mil Tim si Ryn Vin wrn u ss lton Nin () Wi popl must s otr in orr or Sr to t t lttr to mily? n otr wors, i ts popl on t mt tn it is impossil or Sr to t t lttr to mily. Ryn n Vin, u n Nin, n Nin n mily must mt. () Wt o ts vrtis v in ommon? Ty r ll ris. () Ryn n Vin on t mt, wt ns out t rp (otr tn rmovin n )? T rp is not onnt. Tr r now omponnts. () Vin livs r rom Sr so s osn t wnt to iv im t lttr. Wt is t stst wy now? Sr-Tim-wrn-lton-ss-Vin-Ryn-u-Nin-mily () lton s lttr tt wnts to iv to si. Wt is t stst wy or im to o tis? lton-ss-vin-ryn-mil or u-si

. r t ollowin rps plnr? so, rw plnr rprsnttion. not, xplin wy. int: Only on o ts r plnr. Try inin or, suivisions. () Plnr, rwin my vry () Non-plnr: suivision 0 () Non-plnr:, suivision () Non-plnr: suivision. Rrw rp to sow it is plnr. () rwin my vry. () rwin my vry. i

. wor rp s wors s t vrtis. Two wors r jnt i ty ir y lttr. rt onnt wor rp tt ontins t ollowin wors: lo, top, t, mu n r. nswrs my vry. r. mu. t. mu. ru. pt. tu. u. pot. pop. t. tp. o. top. lo. 0. low is mp o Sout mri. rt rp wit t vrtis rprsntin ountris n t s joinin tos ountris wi sr ln orr. So il n Pru r jnt, ut Pru n Uruuy r not. Us your rp to nswr t qustions low. olumi Vnzul uyn Surinm rn uin uor Pru rzil olivi il Pruy Uruuy ourtsy o t.om rntin () in t minimum olourin o t rp, n trmin olour or ountry. Wt out or ountris tt tt sr vry smll orr. Sin orrs o not ross, tr must wy to rw plnr rp o t mp. T -olour torm sys tt ny plnr rp is -olourl. ltou it is possil tt plnr rp is lss tn -olourl, tr is surp (mnin smllr rp witin t oriinl) o (onsistin o rzil, olivi, Pruy, n rntin). Rmmr tt nots t omplt rp wit vrtis tt r ll jnt to otr, wi rquirs t lst olours.

() Wn trin oos ovr ln, $00 tx is pi to ountry wi t oos trvl trou. So i olumi slls o to Vnzul, t lst mount o tx pi is $00. i. Wt is t lst mount o tx pi on wool sipp rom uor to Pruy? $00 ii. Wt ountry n tr wit t most otrs or xtly $00? rzil iii. rzil riss it s txs to $00. Wt is t pst mount o txs pi to sip Vnzuln oil to Pruy? Wt out rn uin to olivi? Vnzul to Pruy: $00; rn uin to olivi: $00 iv. To nour tr, Pru will not tx ny oos oin tou t ountry. il n Surinm wnt to tr lumr n wt. Wt rout will rsult in t lst mount o txs? ow mu will ty py? Surinm, uyn, Vnzul, olumi, Pru, il; $00 () vin wnts to visit vry ountry in Sout mri on is vtion. osn t wnt to visit ny ountry mor tn on sin rossin t orr n tk lon tim! will ly into im, Pru to in is trip n ly out o Montvio, Uruuy. n wt orr soul visit ountry? Pru, uor, olumi, Vnzul, uyn, Surinm, rn uin, rzil, Pruy, olivi, il, rntin, Uruuy. *Two rps r isomorpi i ty r t sm rp rwn in irnt wy. Tis mns tt ll t onntions r t sm, n tr r xtly t sm numr o vrtis, ut t vrtis my v irnt nms n t rps my look irnt. trmin i t ollowin pirs o rps r isomorpi. so, sow wi vrtis mt, or xplin wy not. () Not isomorpi: tr is yl o lnt in t irst, ut not in t son. () somorpi s sown (solutions my vry)

() somorpi s sown (solutions my vry) 0 i j. ulr s Oil is s sttion in in t ountry o Mtisun. T O o t ompny, onr, wnts to visit ll is s sttions in t ountry to nsur tt on is stok wit nou ul. owvr, osn t wnt to visit ny town mor tn on s is vry usy mn. Sust rout onr oul tk rom t oi in t pitl Mttopi, trou town xtly on, n rturn to t pitl. Not tt spit t intrstion o tr iwys in t ntr o t ountry, tr is no wy to n rom on ro to notr (i.. tr is no irt ro rom Mttopi to usston, t.) nswrs my vry. On solution is Mttopi, irl ity, rtion lls, Rius Rivr, Tims Town, qutionvill, usston, Vrtx Vill, Mttopi Vrtx Vill Tims Town usston qutionvill Rius Rivr Mttopi irl ity rtion lls