lec-7.pdf - Today Types of graphs Today Types of graphs...

Info icon This preview shows pages 1–25. Sign up to view the full content.

View Full Document Right Arrow Icon
Today. Types of graphs.
Image of page 1

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Today. Types of graphs. Complete Graphs. Trees. Hypercubes.
Image of page 2
Today. Types of graphs. Complete Graphs. Trees. Hypercubes.
Image of page 3

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Complete Graph. K n complete graph on n vertices.
Image of page 4
Complete Graph. K n complete graph on n vertices. All edges are present.
Image of page 5

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Complete Graph. K n complete graph on n vertices. All edges are present. Everyone is my neighbor.
Image of page 6
Complete Graph. K n complete graph on n vertices. All edges are present. Everyone is my neighbor. Each vertex is adjacent to every other vertex.
Image of page 7

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Complete Graph. K n complete graph on n vertices. All edges are present. Everyone is my neighbor. Each vertex is adjacent to every other vertex.
Image of page 8
Complete Graph. K n complete graph on n vertices. All edges are present. Everyone is my neighbor. Each vertex is adjacent to every other vertex. How many edges?
Image of page 9

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Complete Graph. K n complete graph on n vertices. All edges are present. Everyone is my neighbor. Each vertex is adjacent to every other vertex. How many edges? Each vertex is incident to n - 1 edges.
Image of page 10
Complete Graph. K n complete graph on n vertices. All edges are present. Everyone is my neighbor. Each vertex is adjacent to every other vertex. How many edges? Each vertex is incident to n - 1 edges. Sum of degrees is n ( n - 1 ) .
Image of page 11

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Complete Graph. K n complete graph on n vertices. All edges are present. Everyone is my neighbor. Each vertex is adjacent to every other vertex. How many edges? Each vertex is incident to n - 1 edges. Sum of degrees is n ( n - 1 ) . = Number of edges is n ( n - 1 ) / 2.
Image of page 12
Complete Graph. K n complete graph on n vertices. All edges are present. Everyone is my neighbor. Each vertex is adjacent to every other vertex. How many edges? Each vertex is incident to n - 1 edges. Sum of degrees is n ( n - 1 ) . = Number of edges is n ( n - 1 ) / 2. Remember sum of degree is 2 | E | .
Image of page 13

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
K 4 and K 5 K 5 is not planar.
Image of page 14
K 4 and K 5 K 5 is not planar. Cannot be drawn in the plane without an edge crossing!
Image of page 15

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
K 4 and K 5 K 5 is not planar. Cannot be drawn in the plane without an edge crossing! Prove it!
Image of page 16
K 4 and K 5 K 5 is not planar. Cannot be drawn in the plane without an edge crossing! Prove it! Read Note 5!!
Image of page 17

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Trees! Graph G = ( V , E ) . Binary Tree! More generally.
Image of page 18
Trees: Definitions Definitions:
Image of page 19

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Trees: Definitions Definitions: A connected graph without a cycle.
Image of page 20
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern