Math

User Generated

znyohmnvq

Mathematics

Description

can you please answers questions 2,4,5,6.............................please I want to get full marks

Unformatted Attachment Preview

Handout 21 COMP 163: Discrete Structures, Spring 2018 Nathan Lopez Loyola University, Computer Science Department Problem Set #7 Issued April 9, 2017 Due at 2:00pm on April 20, 2017 1. Consider the following graph with V = {A, B, C, D, E, F } and E = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11}. A F 2 1 3 4 B 5 6 D 8 9 7 C (a) (b) (c) (d) (1 (1 (1 (1 point) point) point) point) E 10 11 Find all pairs of parallel edges. Find all loops. Find all isolated vertices. What vertices are incident on edge 4? 2. (a) (4 points) Draw the complete bipartite graph K2,5 . (b) (3 points) How many edges are in K2,5 ? (c) (5 points) For arbitrary integers m, n 1, how many edges are in the complete bipartite graph Km,n ? 3. Consider the following graph G: T U Y W V Z X 1 (a) (7 points) Find the degree of each vertex in G. (b) (5 points) Does G has an Euler cycle? Why or why not? 4. Consider the following graph: A B C (a) (5 points) Find the adjacency matrix M . (b) (3 points) Calculate M 3 (you do not have to show your work for this, you may use a calculator or other program to compute this matrix multiplication). (c) (3 points) Use M 3 to find the number of paths of length 3 from A to B. 5. Consider the following tree with root a: a c b e d f (a) (3 points) Find the level of each node. (b) (3 points) Find the height of the tree. 2 6. (5 points) Use any algorithm to find a spanning tree of the following graph. Designate the root of your spanning tree. You do not have to show your work. T U Y W V Z X Total: 50 points 3 Preview File Edit View Go Tools Window Help © O LINE ☺ 4A Fri Apr 20 00 08 26 a = AILM.Dilan a h_1_.pdf (page 1 of 3) Q Search Favorites Issued April 9, 2017 Due at 2:00pm on April 20, 2017 AirDrop All My... A Applica... Desktop 1. Consider the following graph with V = {A, B, C, D, E, F} and E = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11}. 5818 .PNG Downlo... Creativ... A F iCloud 3 1 ures of .er-4.pptx iCloud... Desktop 4 5 B D Docum... Devices 6 8 O Remot... 5823 .PNG Shared С ED 11 127.... 10 LIP Tags Red (1).zip Orange Yellow (a) (1 point) Find all pairs of parallel edges. (b) (1 point) Find all loops. (C) (1 point) Find all isolated vertices. (d) (1 point) What vertices are incident on edge 4? Green Blue Purple rk1solutio .pdf Gray All Tag... 2. (a) (4 points) Draw the complete bipartite graph K 2,5. (b) (3 points) How many edges are in K2,5? (c) (5 points) For arbitrary integers m, n > 1, how many edges are in the complete bipartite graph Km,n? rk07soluti .pdf a homework8solutions.pdf (page 5 of 5) Preview File Edit View Go Tools Window Help © O LINE ☺ 4A Fri Apr 20 00 08 36 a lil AILMA. Dilan h_1_.pdf (page 2 of 3) 0 Q Search Favorites 4. Consider the following graph: PCX AirDrop All My... A Applica... Desktop A 4.docx Downlo... Creativ... B iCloud 2 Study e.pdf iCloud... Desktop Docum... С DCX Devices .docx O Remot... Shared 127.... (a) (5 points) Find the adjacency matrix M. (b) (3 points) Calculate M: (you do not have to show your work for this, you may use a calculator or other program to compute this matrix multiplication). (c) (3 points) Use M3 to find the number of paths of length 3 from A to B. PGZ Tags Red (1).zip pgz Orange Yellow 5. Consider the following tree with root a: Green Blue a lyguide.p if Purple Gray All Tag... b C Irkbsoluti .pdf a homework8solutions.pdf (page 5 of 5) ☺ Preview File Edit View Go Tools Window Help © O LINE 4A Fri Apr 20 00 08 42 Q = ALL. Dilan h_1_.pdf (page 2 of 3) 0 Q Search Favorites 2010 SJܫܕܫܗܗܢܗܢܝ LV14 AirDrop All My... A Applica... Desktop (b) (3 points) Calculate M? (you do not have to show your work for this, you may use a calculator or other program to compute this matrix multiplication). (c) (3 points) Use M to find the number of paths of length 3 from A to B. ntation ..eya.pptx Downlo... 5. Consider the following tree with root a: Creativ... DF a iCloud 03%252c .1239.pdf iCloud... Desktop Docum... b C Devices O Remot... nutations ryam.pdf Shared 127.... d e PGZ Tags Red ip 2.cpgz Orange Yellow f Green Blue lyguide.p af Purple (a) (3 points) Find the level of each de. (b) (3 points) Find the height of the tree. Gray All Tag... rk5soluti .pdf a homework8solutions.pdf (page 5 of 5) 4 Preview File Edit View Go ♡ Tools Window Help © LINE O Fri Apr 20 00:08:47 Q lil ALMA Dilan h_1_.pdf (page 3 of 3) Q Search Favorites AirDrop All My... A Applica... Desktop entation .eya.pptx Downlo... 6. (5 points) Use any algorithm to find a spanning tree of the following graph. Designate the root of your spanning tree. You do not have to show your work. Creativ... iCloud iClo... T rkbsoluti .pdf Y Desktop Docum... Devices O Remot... U W Z ures of .er-2.pptx Shared 127.... PGZ Tags V Red X zip.cpgz Orange Yellow Green Total: 50 points DCX Blue Purple ntation ile.docx Gray All Tag... Irk4soluti .pdf a homework8solutions.pdf (page 5 of 5)
Purchase answer to see full attachment
User generated content is uploaded by users for the purposes of learning and should be used following Studypool's honor code & terms of service.

Explanation & Answer

Attached.

Question 2.

Question 4.

(a) Adjacency matrix M of graph G
A

B

C

0 1
1 0
1 0

1
0
0

0 1
1 0
1 0

1
0
0

0 1
1 0
1 0

1
0
0

0 1
1 0
1 0

1
0
0

2 0
0 1
0 1

0
1
1

0 1
1 0
1 0

1
0
0

0 2
2 0
2 0

2
0
0

(b) Calculate M3 =

=

The final...


Anonymous
Great! Studypool always delivers quality work.

Studypool
4.7
Trustpilot
4.5
Sitejabber
4.4

Related Tags