6 blocks blocks definition 11 a block of a graph is a

Info icon This preview shows page 5. Sign up to view the full content.

6 Blocks Blocks Definition 11. A block of a graph is a maximal connected subgraph that has no cut-vertices. Each block is either K 1 , K 2 , or a maximal 2-connected subgraph. An edge of a graph is a block iff it is a bridge. It can be proved that any two blocks have at most one vertex in common. Roughly speaking, any connected graph is built by blocks joined by cut-vertices. (Examples on blackboard.)
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.
  • One '14
  • Graph Theory, Planar graph, Menger's theorem, Symmetric graph

{[ 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