Scribd Logo
Upload

Welcome to Scribd!

  • 171 views

    Https - Mygcdn1.upsi - Edu.my - Documents - 2020 - Courses - SMA3023 - Material - K01746 - 20200324024150 - A192 CHAPTER 3 GRAPHS AND TREES

    Uploaded by

    hariz syazwan
    This document discusses graphs and trees in discrete mathematics. It covers representing graphs using adjacency matrices, defining graph terminology like degrees and neighborhoods. It also covers special types of graphs like Eulerian and Hamiltonian graphs, finding Euler circuits and paths. It discusses spanning trees and finding all spanning trees of graphs.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Https - Mygcdn1.upsi - Edu.my - Documents - 2020 - Courses - SMA3023 - Material - K01746 - 20200324024150 - A192 CHAPTER 3 GRAPHS AND TREES

    Uploaded by

    hariz syazwan
    171 views22 pages
    This document discusses graphs and trees in discrete mathematics. It covers representing graphs using adjacency matrices, defining graph terminology like degrees and neighborhoods. It also covers special types of graphs like Eulerian and Hamiltonian graphs, finding Euler circuits and paths. It discusses spanning trees and finding all spanning trees of graphs.

    Original Title

    https___mygcdn1.upsi.edu.my_documents_2020_courses_SMA3023_material_K01746_20200324024150_A192 CHAPTER 3 GRAPHS AND TREES

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document discusses graphs and trees in discrete mathematics. It covers representing graphs using adjacency matrices, defining graph terminology like degrees and neighborhoods. It also covers special types of graphs like Eulerian and Hamiltonian graphs, finding Euler circuits and paths. It discusses spanning trees and finding all spanning trees of graphs.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    171 views22 pages

    Https - Mygcdn1.upsi - Edu.my - Documents - 2020 - Courses - SMA3023 - Material - K01746 - 20200324024150 - A192 CHAPTER 3 GRAPHS AND TREES

    Uploaded by

    hariz syazwan
    This document discusses graphs and trees in discrete mathematics. It covers representing graphs using adjacency matrices, defining graph terminology like degrees and neighborhoods. It also covers special types of graphs like Eulerian and Hamiltonian graphs, finding Euler circuits and paths. It discusses spanning trees and finding all spanning trees of graphs.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 22

    SMA3023 DISCRETE MATHEMATICS

    SEMESTER 2 2019/2020

    CHAPTER 3: GRAPHS AND TREES

    BY:

    DR. NOR ZILA ABD HAMID


    DR. NOR SURIYA ABD KARIM

    1
    Graphs

    2
    Representing Graph

    3
    Draw an undirected graph for the following adjacency matrices:

    0 1 1 1
    1 
    0 1 0

    1 1 0 0
     
    1 0 0 0

    4
    Determine adjacency matrices for the following undirected graph:

    0 1 1 0
    1 
    0 0 1

    1 0 0 1
     
    0 1 1 0

    5
    Graph Terminology

    6
    Graph Terminology
    Degrees and Neighborhoods

    7
    What are the degrees and neighborhoods of the vertices in the graphs below?

    8
    Special Types of Graphs

    9
    Subgraphs

    List all subgraphs of the below graph:

    10
    Euler Paths and Circuits
    The town of Königsberg, Prussia (now called Kaliningrad – part of the Russian republic) was
    divided into four sections by the branches of Pregel River. There are seven bridges connected
    these four regions.

    11
    Euler Paths and Circuits
    The townspeople talked and wondered whether it was possible to start at some location in the
    town, travel across all the bridges without crossing any bridge twice, and return to the starting
    point.

    12
    Euler Paths and Circuits
    Later, in 1736 a mathematician named Leonhard Euler studied this problem and introduced the
    graph theory by representing the four regions by vertices and the bridges by edges.

    13
    Euler Paths and Circuits

    14
    Euler Paths and Circuits
    Determine whether each of the graph below is Eulerian. If it is, state its Euler circuit. Or else,
    determine its Euler path.

    Eulerian.
    Euler circuit: p, k, l, k, l, p, m, l, n, m, n, o, p

    15
    Euler Paths and Circuits

    Not Eulerian.
    Euler path: v, w, x, y, w

    16
    Hamiltonian Paths and Circuits

    17
    Hamiltonian Paths and Circuits
    Which of the graphs below is Hamiltonian or has Hamiltonian path? Give its Hamiltonian
    circuit and Hamiltonian path (if any).

    Hamiltonian path: w,x,y,z

    18
    Hamiltonian Paths and Circuits

    Neither has Hamiltonian circuit nor Hamiltonian path

    19
    Trees

    20
    Spanning Tree

    Draw all spanning trees of:

    21
    Spanning Tree

    Draw all spanning trees of:

    22

    You might also like