1 / 11

Group 10 Project Part 3

Group 10 Project Part 3. Derrick Jasso Rodolfo Garcia Ivan Lopez M. Section 10.1 #36. 36. Recall that K m,n denotes a complete bipartite graph on (m, n) vertices. a. Draw K 4,2 b. Draw K 1,3 c. Draw K 3,4 d. How many vertices of K m,n have degree m? degree n?

pink
Download Presentation

Group 10 Project Part 3

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Group 10 Project Part 3 Derrick Jasso Rodolfo Garcia Ivan Lopez M.

  2. Section 10.1 #36 36. Recall that Km,n denotes a complete bipartite graph on (m, n) vertices. a. Draw K4,2 b. Draw K1,3 c. Draw K3,4 d. How many vertices of Km,n have degree m? degree n? e. What is the total degree of Km,n? f. Find a formula in terms of m and n for the number of edges of Km,n. Explain.

  3. Solution a) K4,2 b)K1,3

  4. Solution c)K3,4 d) If n≠m, the vertices of Km,n are divided into two groups: one of size m and the other of size n. Every vertex in the group of size m has degree n because each is connected to every vertex in the group of size n. So Km,n has n vertices of degree m. Similarly, every vertex in the group of size n has degree m since each is connected to every vertex in the group of size m. So Km,n has n vertices of degree m.

  5. Solution e) The total degree of Km,nis 2mn because Km,nhas m vertices of degree n and n vertices of degree m. The number of edges of Km,n = mn. This is because the total degree of Km,n is 2mn, and so, by Theorem 11.1.1, Km,nhas 2mn = mnedges. 2

  6. Section 10.1 #37 Find which of the following graphs are bipartite. Redraw the bipartite graphs so that their bipartite nature is evident.

  7. Solution a.) b.)Not bipartite. No possible way to create two subsets without vertices relating to one another within the same subset. c.) d.) Not bipartite. No possible way to create two subsets without vertices relating to one another within the same subset. v1 v2 v3 v4 v1 v2 v3 v4 v5 v6

  8. Solution Continued d.) Not bipartite. No possible way to create two subsets without vertices relating to one another within the same subset. e.) f.) Not bipartite. No possible way to create two subsets without vertices relating to one another within the same subset. v1 v2 v3 v5 v4

  9. Summary of Main Results Definition: Let n be a positive integer. A complete graph on n vertices, denoted Kn, is a simple graph with n vertices and exactly one edge connecting each pair of distinct vertices.

  10. Definition: Let m and n be positive integers. A complete bipartite graph on (m,n) vertices, denoted Km,n, is a simple graph with distinct vertices v1, v2, … ,vm and w1, w2, … ,wn that satisfies the following properties: For all i,k = 1, 2, … ,m and for all j, l = 1, 2, … , n, There is an edge from each vertex vi to each vertex wj. There is no edge from any vertex vi to any other vertex vk. There is no edge from any vertex wj to any other vertex wl.

  11. Leonhard Euler Euler lived from April 15, 1707 to September 18, 1783. Euler is considered one of the greatest mathematician of all time. With contributions to calculus and wrote the first paper on graph theory. Not only was he a great mathematician but, he was also renowned for his work in mechanics, fluid dynamics, optics, and astronomy.

More Related